Sciweavers

7 search results - page 1 / 2
» The traveling salesman problem with pickup and delivery: pol...
Sort
View
MP
2010
145views more  MP 2010»
13 years 3 months ago
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-toone relationship. ...
Irina Dumitrescu, Stefan Ropke, Jean-Franço...
NETWORKS
2010
13 years 3 months ago
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading
In the Traveling Salesman Problem with Pickup and Delivery (TSPPD) a single vehicle must serve a set of customer requests, each defined by an origin location where a load must be...
Jean-François Cordeau, Manuel Iori, Gilbert...
CEC
2010
IEEE
13 years 3 months ago
The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach
We introduce a novel combinatorial optimization problem: the one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD), characterized by the fact th...
Rafael Falcón, Xu Li, Amiya Nayak, Ivan Sto...
DISOPT
2010
138views more  DISOPT 2010»
13 years 5 months ago
The Delivery Man Problem with time windows
In this paper, a variant of the Traveling Salesman Problem with Time Windows is considered, which consists in minimizing the sum of travel durations between a depot and several cu...
Géraldine Heilporn, Jean-François Co...
CORR
2011
Springer
239views Education» more  CORR 2011»
12 years 8 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...