Branch-and-cut forthepickupanddeliverytravelingsalesmanproblemwith FIFO loading

This paperintroducesabranch-and-cutalgorithmforavariantofthepickupanddeliverytraveling salesman probleminwhichpickupsanddeliveriesmustobeythefirst-in-first-outpolicy.Weproposea new mathematicalformulationoftheproblemandseveralfamiliesofvalidinequalitieswhichareused within thebranch-and-cutalgorithm.Computationalexperimentsoninstancesfromtheliteratureshow that thisalgorithmoutperformsexistingexactalgorithms,andthatsomeinstanceswithupto25requests (50 nodes)canbesolvedinreasonablecomputingtime.