Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21751
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRAMAEKERS, Katrien-
dc.contributor.authorJANSSENS, Gerrit-
dc.contributor.authorMAES, Tabitha-
dc.contributor.authorCARIS, An-
dc.date.accessioned2016-07-14T11:57:45Z-
dc.date.available2016-07-14T11:57:45Z-
dc.date.issued2015-
dc.identifier.citationAl-Akaidi, M.; Ayesh, A. (Ed.). Proceedings of the 2015 European Simulation and Modelling Conference (ESM’2015), p. 428-432-
dc.identifier.isbn9789077381908-
dc.identifier.urihttp://hdl.handle.net/1942/21751-
dc.description.abstractA pickup and delivery problem is a special case of the vehicle routing problem in which goods at customer sites are either picked up or delivered. A carrier has only a limited capacity within his own vehicle fleet. Therefore the carrier can only serve a selection of customers. Transport requests of clients are accepted only if they contribute to a higher total profit. A paired pickup and delivery selection problem is hardly investigated in literature. In case the carrier has a fixed fleet with a set of drivers, it is realistic that drivers have to be paid whether the truck is used or not. This leads to a fixed cost per vehicle in the decision problem. This practical aspect is modeled with the Pickup and Delivery with selection of customers. A mixed-integer programming formulation is given. A meta-heuristic method, more specifically a tabu-embedded simulated annealing algorithm, is developed to solve the problem in an efficient way. The heuristic is explained in detail.-
dc.language.isoen-
dc.publisherEurosis-
dc.rights© 2015 EUROSIS-ETI-
dc.subject.othervehicle routing; pickup and delivery problem; metaheuristics; optimization-
dc.titlePickup and delivery selection with a fixed vehicle cost-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsAl-Akaidi, M.-
local.bibliographicCitation.authorsAyesh, A.-
local.bibliographicCitation.conferencedate26-28 October 2015-
local.bibliographicCitation.conferencename2015 European Simulation and Modelling Conference (ESM’2015)-
local.bibliographicCitation.conferenceplaceLeicester, U.K.-
dc.identifier.epage432-
dc.identifier.spage428-
local.bibliographicCitation.jcatC1-
local.publisher.placeOstend, Belgium-
dc.relation.referencesArda Y., Y. Crama and T. Pironet (2008). “A profitable pickup and delivery problem with time windows”. ORBEL 22(22nd National Conference of the Belgian Operations Research Society). Booklet of abstracts, Brussels, 26-28 January, pp. 76-77 (http://orbel22.hallot.net/docs/BookletORBEL22.pdf Frantzeskakis, L.F. and W.B. Powel (1990). A successive linear approximation procedure for stochastic, dynamic vehicle allocation problems. Transportation Science, 24(1), 40-57. Kleywegt A.J. and J.D. Papastravou (1998). Acceptance and dispatching policies for a distribution problem. Transportation Science, 32, 127-141. Li, H. and A. Lim (2001). A metaheuristic for the pickup and delivery problem with time windows. Proceedings of the 13th IEEE International Conference on Tools and Artificial Intelligence, November 2001, Dallas TX, USA, pp. 160-167. Maes T., K. Ramaekers, A. Caris, G.K. Janssens and T. Bellemans (2011). Simulation of logistic decisions within a freight transportation model, In: S. Balsamo (ed.), Proceedings of the 2011 Industrial Simulation Conference (ISC’2011), Venice, Italy, pp. 185-191. Mitrovic-Minic S. (1998). “Pickup and delivery problem with time windows: a survey”, Technical report TR1998-12, School of Computers Science, Simon Fraser University, Burnaby, BC, Canada (ftp://fas.sfu.ca/pub/cs/techreports/1998). Parragh S.N., K.F. Doerner and R.F. Hartl (2008). A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations, Journal für Betriebswirtschaft, 58(2), 81-117. Ramaekers K., A. Caris, G.K. Janssens and T. Maes (2015). Pickup and delivery selection with compulsory requests. In: P.J. Sequeria Gonçalves (ed.), Proceedings of the 11th Future Business Technology Conference (FUBUTEC’2015), Lisbon, Portugal, 27-29 April 2015, pp. 28-33 (ISBN978-90-77381-88-5). Schönberger J., H. Kopfer and D. Mattfeld (2002). “A combined approach to solve the pickup and delivery selection problem”, Operations Research Proceedings 2002, In: Leopold-Wildburger, U., Rendl, F. and Wascher, G., pp. 150-155. Schönberger J. (2005). Operational freight carrier planning. Basic concepts, optimization models and advanced memetic algorithms. Springer, Berlin (ISBN -540-25318-1). Ting C.-K. and X.-L. Liao (2013). The selective pickup and delivery problem: formulation and a memetic algorithm. International Journal of Production Economics, 141(1), 199-211. Verweij B. and K. Aardal (2003). The merchant subtour problem, Mathematical Programming, 94(2-3), 295-322.-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.identifier.vabbc:vabb:415203-
local.bibliographicCitation.btitleProceedings of the 2015 European Simulation and Modelling Conference (ESM’2015)-
item.contributorJANSSENS, Gerrit-
item.contributorRAMAEKERS, Katrien-
item.contributorMAES, Tabitha-
item.contributorCARIS, An-
item.validationvabb 2019-
item.fulltextWith Fulltext-
item.fullcitationRAMAEKERS, Katrien; JANSSENS, Gerrit; MAES, Tabitha & CARIS, An (2015) Pickup and delivery selection with a fixed vehicle cost. In: Al-Akaidi, M.; Ayesh, A. (Ed.). Proceedings of the 2015 European Simulation and Modelling Conference (ESM’2015), p. 428-432.-
item.accessRightsRestricted Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
ESM2015.pdf
  Restricted Access
published version5.57 MBAdobe PDFView/Open    Request a copy
Show simple item record

Page view(s)

20
checked on Jun 28, 2022

Download(s)

6
checked on Jun 28, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.