Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/13084
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BRAEKERS, Kris | - |
dc.contributor.author | CARIS, An | - |
dc.contributor.author | JANSSENS, Gerrit K. | - |
dc.date.accessioned | 2012-01-26T10:40:15Z | - |
dc.date.available | 2012-01-26T10:40:15Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT, p. 344-353 | - |
dc.identifier.issn | 1877-0428 | - |
dc.identifier.uri | http://hdl.handle.net/1942/13084 | - |
dc.description.abstract | Drayage 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.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.ispartofseries | Procedia Social and Behavioral Sciences | - |
dc.subject.other | Drayage operations; vehicle routing; deterministic annealing; bi-objective; traveling salesman problem | - |
dc.title | A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.conferencedate | SEP 06-09, 2011 | - |
local.bibliographicCitation.conferencename | 14th Euro Working Group on Transportation/26th Mini Euro Conference/1st European Scientific Conference on Air Transport | - |
local.bibliographicCitation.conferenceplace | Poznan Univ Technol, Poznan, POLAND | - |
dc.identifier.epage | 353 | - |
dc.identifier.spage | 344 | - |
dc.identifier.volume | 20 | - |
local.bibliographicCitation.jcat | C1 | - |
local.publisher.place | Amsterdam | - |
local.type.refereed | Refereed | - |
local.type.specified | Proceedings Paper | - |
local.relation.ispartofseriesnr | 20 | - |
dc.bibliographicCitation.oldjcat | A1 | - |
local.identifier.vabb | c:vabb:324571 | - |
dc.identifier.doi | 10.1016/j.sbspro.2011.08.040 | - |
dc.identifier.isi | 000299524200039 | - |
local.bibliographicCitation.btitle | STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT | - |
item.validation | ecoom 2014 | - |
item.validation | vabb 2012 | - |
item.fulltext | With Fulltext | - |
item.fullcitation | BRAEKERS, Kris; CARIS, An & JANSSENS, Gerrit K. (2011) A deterministic annealing algorithm for a bi-objective full truckload vehicle routing problem in drayage operations. In: STATE OF THE ART IN THE EUROPEAN QUANTITATIVE ORIENTED TRANSPORTATION AND LOGISTICS RESEARCH, 2011: 14TH EURO WORKING GROUP ON TRANSPORTATION & 26TH MINI EURO CONFERENCE & 1ST EUROPEAN SCIENTIFIC CONFERENCE ON AIR TRANSPORT, p. 344-353. | - |
item.accessRights | Restricted Access | - |
item.contributor | BRAEKERS, Kris | - |
item.contributor | CARIS, An | - |
item.contributor | JANSSENS, Gerrit K. | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
braekersderav.pdf Restricted Access | 226.56 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
15
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
20
checked on Oct 12, 2024
Page view(s)
114
checked on Aug 25, 2023
Download(s)
94
checked on Aug 25, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.