Title of article
Branch-and-cut forthepickupanddeliverytravelingsalesmanproblemwith FIFO loading
Author/Authors
Jean-François Cordeau، نويسنده , , MauroDellʹAmicob، نويسنده , , ManuelIorib، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2010
Pages
11
From page
970
To page
980
Abstract
This paperintroducesabranch-and-cutalgorithmforavariantofthepickupanddeliverytraveling
salesman probleminwhichpickupsanddeliveriesmustobeythefirst-in-first-outpolicy.Weproposea
new mathematicalformulationoftheproblemandseveralfamiliesofvalidinequalitieswhichareused
within thebranch-and-cutalgorithm.Computationalexperimentsoninstancesfromtheliteratureshow
that thisalgorithmoutperformsexistingexactalgorithms,andthatsomeinstanceswithupto25requests
(50 nodes)canbesolvedinreasonablecomputingtime.
Keywords
Traveling salesman problem , Pickup and delivery , FIFO loading , Branch-and-cut
Journal title
Computers and Operations Research
Serial Year
2010
Journal title
Computers and Operations Research
Record number
927706
Link To Document