DocumentCode
532243
Title
Notice of Retraction
Applying PRG model to typical optimization algorithm development in logistics
Author
Yang Wu ; Haihe Shi
Author_Institution
Coll. of Inf. Sci. & Eng., Central South Univ., Changsha, China
Volume
4
fYear
2010
fDate
22-24 Oct. 2010
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The problem reduction graph (PRG) is a model for formally describing the reduction processes of combinatorial optimization problems and systematically deriving efficient algorithms for the problems. The paper applies the model for several optimization problems including vehicle loading, vehicle routing, and warehouse location, which are typical problems in the domain of logistics. We work out their problem-solving algorithms by specification transformation and derivation, and show that the model is capable of developing algorithms covering classic design tactics including branch-and-bound, greedy, and dynamic programming.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The problem reduction graph (PRG) is a model for formally describing the reduction processes of combinatorial optimization problems and systematically deriving efficient algorithms for the problems. The paper applies the model for several optimization problems including vehicle loading, vehicle routing, and warehouse location, which are typical problems in the domain of logistics. We work out their problem-solving algorithms by specification transformation and derivation, and show that the model is capable of developing algorithms covering classic design tactics including branch-and-bound, greedy, and dynamic programming.
Keywords
computational complexity; directed graphs; logistics; optimisation; problem solving; PRG model; combinatorial optimization problem; design tactics; dynamic programming; logistics; optimization algorithm development; problem reduction graph; problem solving algorithm; reduction processes; specification transformation; vehicle loading; vehicle routing; warehouse; Complexity theory; Variable speed drives; combinatorial optimization; problem reduction graph (PRG); specification transformation;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location
Taiyuan
Print_ISBN
978-1-4244-7235-2
Type
conf
DOI
10.1109/ICCASM.2010.5620198
Filename
5620198
Link To Document