A simple greedy algorithm for a class of shuttle transportation problems

Greedy algorithms for combinatorial optimization problems are typically direct and efficient, but hard to prove optimality. The paper presents a special class of transportation problems where a supplier sends goods to a set of customers, returning to the source after each delivery. We show that thes...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 3; no. 4; pp. 491 - 497
Main Authors Zheng, Yujun, Xu, Chuanqing, Xue, Jinyun
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer-Verlag 01.09.2009
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Shuttle transportation problems
Greedy algorithm
Combinatorial optimization
Online AccessGet full text
ISSN1862-4472
1862-4480
DOI10.1007/s11590-009-0126-9

Cover

More Information
Summary:Greedy algorithms for combinatorial optimization problems are typically direct and efficient, but hard to prove optimality. The paper presents a special class of transportation problems where a supplier sends goods to a set of customers, returning to the source after each delivery. We show that these problems with different objective functions share a common structural property, and therefore a simple but powerful generic greedy algorithm yields optimal solutions for all of them.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-009-0126-9