Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/13084
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBRAEKERS, Kris-
dc.contributor.authorCARIS, An-
dc.contributor.authorJANSSENS, Gerrit K.-
dc.date.accessioned2012-01-26T10:40:15Z-
dc.date.available2012-01-26T10:40:15Z-
dc.date.issued2011-
dc.identifier.citationZak, Jacek (Ed.). The State of the Art in the European Quantitative Oriented Transportation and Logistics Research – 14th Euro Working Group on Transportation & 26th Mini Euro Conference & 1st European Scientific Conference on Air Transport, Elsevier Science BV, p. 344-353-
dc.identifier.issn1877-0428-
dc.identifier.urihttp://hdl.handle.net/1942/13084-
dc.description.abstractDrayage operations involve transporting loaded and empty containers in the hinterland of a port. In this paper a full truckload vehicle routing problem in drayage operations is studied. Either the origin or destination of empty container transport requests is unknown in advance. A two-phase solution algorithm using deterministic annealing is presented to solve the bi-objective problem, minimizing the number of vehicles used and minimizing total distance travelled. Results on random problem instances show that the algorithm is able to find sets of non-dominated solutions of good quality in a small amount of computation time.-
dc.language.isoen-
dc.publisherElsevier Science BV-
dc.relation.ispartofseriesProcedia Social and Behavioral Sciences-
dc.rights2011 Published by Elsevier Ltd. Open access under CC BY-NC-ND license.-
dc.subject.otherDrayage operations-
dc.subject.othervehicle routing-
dc.subject.otherdeterministic annealing-
dc.subject.otherbi-objective-
dc.subject.othertraveling salesman problem-
dc.titleA deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations-
dc.typeProceedings Paper-
local.bibliographicCitation.authorsZak, Jacek-
local.bibliographicCitation.conferencedate2011, September 06-09-
local.bibliographicCitation.conferencename14th Euro Working Group on Transportation/26th Mini Euro Conference/1st European Scientific Conference on Air Transport-
local.bibliographicCitation.conferenceplacePoznan Univ Technol, Poznan, POLAND-
dc.identifier.epage353-
dc.identifier.spage344-
dc.identifier.volume20-
local.bibliographicCitation.jcatC1-
local.publisher.placeSARA BURGERHARTSTRAAT 25, PO BOX 211, 1000 AE AMSTERDAM, NETHERLANDS-
local.type.refereedRefereed-
local.type.specifiedProceedings Paper-
local.relation.ispartofseriesnr20-
dc.bibliographicCitation.oldjcatA1-
local.identifier.vabbc:vabb:324571-
dc.identifier.doi10.1016/j.sbspro.2011.08.040-
dc.identifier.isi000299524200039-
local.bibliographicCitation.btitleThe State of the Art in the European Quantitative Oriented Transportation and Logistics Research – 14th Euro Working Group on Transportation & 26th Mini Euro Conference & 1st European Scientific Conference on Air Transport-
local.uhasselt.internationalno-
item.validationecoom 2014-
item.validationvabb 2012-
item.fullcitationBRAEKERS, Kris; CARIS, An & JANSSENS, Gerrit K. (2011) A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations. In: Zak, Jacek (Ed.). The State of the Art in the European Quantitative Oriented Transportation and Logistics Research – 14th Euro Working Group on Transportation & 26th Mini Euro Conference & 1st European Scientific Conference on Air Transport, Elsevier Science BV, p. 344-353.-
item.contributorBRAEKERS, Kris-
item.contributorCARIS, An-
item.contributorJANSSENS, Gerrit K.-
item.fulltextWith Fulltext-
item.accessRightsOpen Access-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
braekersderav.pdfPublished version226.56 kBAdobe PDFView/Open
Show simple item record

SCOPUSTM   
Citations

22
checked on Oct 29, 2025

WEB OF SCIENCETM
Citations

21
checked on Oct 26, 2025

Google ScholarTM

Check

Altmetric


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