Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery |
| |
| Authors: | Anand Subramanian Eduardo Uchoa Artur Alves Pessoa Luiz Satoru Ochi |
| |
| Affiliation: | aUniversidade Federal da Paraíba, Departamento de Engenharia de Produção, Brazil;bUniversidade Federal Fluminense, Instituto de Computação, Brazil;cUniversidade Federal Fluminense, Departamento de Engenharia de Produção, Brazil |
| |
| Abstract: | We propose a branch-and-cut algorithm for the VRPSPD where the constraints that ensure that the capacities are not exceeded in the middle of a route are applied in a lazy fashion. The algorithm was tested in 87 instances with 50–200 customers, finding improved lower bounds and several new optimal solutions. |
| |
| Keywords: | Vehicle routing Simultaneous pickup and delivery Branch-and-cut |
| 本文献已被 ScienceDirect 等数据库收录！ |
