An exact approach for solving pickup-and-delivery traveling salesman problems with neighborhoods
Year of publication: |
2023
|
---|---|
Authors: | Gao, Cai ; Wei, Ningji ; Walteros, Jose L. |
Published in: |
Transportation science. - Hanover, Md. : INFORMS, ISSN 1526-5447, ZDB-ID 2015901-8. - Vol. 57.2023, 6, p. 1560-1580
|
Subject: | close-enough traveling salesman problem | generalized Benders decomposition | mixed-integer nonlinear programing | transportation and logistics | UAV routing | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Logistik | Logistics |
-
Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
Gendreau, Michel, (2015)
-
Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
Cornu, Marek, (2017)
-
Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits
Liu, Jiaojiao, (2024)
- More ...
-
Integer programming formulations for minimum spanning tree interdiction
Wei, Ningji, (2021)
-
Integer programming methods for solving binary interdiction games
Wei, Ningji, (2022)
-
A new method of identifying influential nodes in complex networks based on TOPSIS
Du, Yuxian, (2014)
- More ...