|
|||||
|
|
Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery |
|
| Authors: | Anand Subramanian Eduardo Uchoa Artur Alves Pessoa Luiz Satoru Ochi |
| Institution: | 1. Departamento de Engenharia de Produ??o, Centro de Tecnologia, Universidade Federal da Paraíba, Campus I-Bloco G, Cidade Universitária, Jo?o Pessoa, PB, ?58051-970, Brazil 2. Instituto de Computa??o, Universidade Federal Fluminense, Rua Passo da Pátria 156, Bloco E-3oandar, S?o Domingos, Niterói, RJ, ?24210-240, Brazil 3. Departamento de Engenharia de Produ??o, Universidade Federal Fluminense, Rua Passo da Pátria 156, Bloco E-4oandar, S?o Domingos, Niterói, RJ, 24210-240, Brazil |
| Abstract: | This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time and some LBs were improved. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |