𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

✍ Scribed by Waqar Malik; Sivakumar Rathinam; Swaroop Darbha


Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
152 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Lagrangian-based algorithm for a Multi
✍ S. Yadlapalli; W.A. Malik; S. Darbha; M. Pachter πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 713 KB

In this manuscript, we consider the problem of motion planning of m Dubins' vehicles through n points in a plane. The initial location and heading of the vehicles is specified and is assumed to be distinct for each vehicle. A motion plan for a vehicle is given by the sequence of points and the corre

An efficient composite heuristic for the
✍ Jacques Renaud; Fayez F. Boctor πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut

A branch-and-cut algorithm for the picku
✍ 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