|
|
|
|
|
Ryo Matsuoka, Koichi Kobayashi and Yuh Yamashita
A pickup and delivery problem by multiple agents has many applications, such as food delivery service and disaster rescue. In this problem, there are cases where fuels must be considered (e.g., the case of using drones as agents). In addition, there are ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Hao Zheng, Xingchen Zhang and Junhua Chen
Instantaneous mega-traffic flow has long been one of the major challenges in the management of mega-cities. It is difficult for the public transportation system to cope directly with transient mega-capacity flows, and the uneven spatiotemporal distributi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Napoleão Nepomuceno, Ricardo Barboza Saboia and Plácido Rogério Pinheiro
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neigh...
ver más
|
|
|
|
|
|
|
|
|
|
The sustainability and complexity of logistics networks come from the temporally and spatially uneven distributions of freight demand and supply. Operation strategies without considering the sustainability and complexity could dramatically increase the e...
ver más
|
|
|
|
|
|
|
|
|
|
|
Pasquale Carotenuto, Fabio Martis
Pág. 632 - 639
In this work a two level heuristic algorithm is described for a nearly real-time multi-vehicle many-to-many Dial-A-Ride Problem (DARP). This algorithm is ready to support a Demand Responsive Transportation System in which we face the problem of quickly e...
ver más
|
|
|
|
|
|
|
|
|
|
|
Roberto Baldacci, Enrico Bartolini, and Aristide Mingozzi
Pág. 414 - 426
|
|
|
|
|
|
|
|
|
|
|
Mitrovic-Minic, S. Laporte, G.
Pág. 635 - 655
|
|
|
|
|
|
|
|
|
|
|
Mitrovic-Minic, S. Krishnamurti, R. Laporte, G.
Pág. 669 - 685
|
|
|
|
|
|
|
|
|
|
|
Nanry, William P.; Wesley Barnes, J.
Pág. 107 - 121
|
|
|
|
|
|