๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithm for the traveling salesman problem with pickup and delivery customers

โœ Scribed by Bahman Kalantari; Arthur V. Hill; Sant R. Arora

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
819 KB
Volume
22
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Approximation algorithms for the capacit
Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries
โœ Shoshana Anily; Julien Bramel ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 100 KB ๐Ÿ‘ 2 views

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited

A branch-and-cut algorithm for the picku
A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
โœ Jean-Franรงois Cรดtรฉ; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Je ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 208 KB ๐Ÿ‘ 1 views

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item