A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts |
| |
| Institution: | 1. ICD-LOSI, UMR CNRS 6281, Troyes University of Technology, Troyes, France;2. Mathematical Sciences Department, Universidad EAFIT, Medellín, Colombia;1. Instituto de Computação, Universidade Federal Fluminense, Rua Passo da Pátria, 156 - São Domingos, Niterói RJ 24210-240, Brazil;2. Departamento de Engenharia Industrial, Pontifícia Universidade Católica do Rio de Janeiro, Rua Marquês de São Vicente, 225 - Gávea, Rio de Janeiro RJ 22451-900, Brazil;3. Dpt. de Informática, Pontifícia Universidade Católica do Rio de Janeiro Rua Marquês de São Vicente, 225 - Gávea, Rio de Janeiro RJ 22451-900, Brazil;4. Departamento de Computação, Universidade Federal de Ouro Preto, Campus Universitário, Morro do Cruzeiro, Ouro Preto - MG 35400-000, Brazil;5. Department of Business Administration, Universität Wien, Oskar-Morgenstern-Platz 1, Vienna A-1090, Austria |
| |
| Abstract: | We propose a new multi-start solution approach for the split-delivery vehicle routing problem with minimum delivery amounts (SDVRP-MDA). Initial solutions are generated by both node-insertion and route-addition procedures with a single parameter to control the restart. These solutions are then improved by a variable neighborhood descent metaheuristic with a novel search operator inspired by node-ejection chains. We test the proposed approach with 32 benchmark instances for four different minimum delivery fractions. Using the proposed algorithm, out of 128 cases tested, we find 81 best known solutions and 34 new best solutions; overall, we find 43 new best solutions. |
| |
| Keywords: | Vehicle routing Split delivery Minimal delivery amount Variable neighborhood descent Node-ejection chains Heuristics |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
