dc.contributor.author | Chang, H. | en |
dc.contributor.author | Jula, H. | en |
dc.contributor.author | Chassiakos, Anastassios | en |
dc.contributor.author | Ioannou, Petros A. | en |
dc.creator | Chang, H. | en |
dc.creator | Jula, H. | en |
dc.creator | Chassiakos, Anastassios | en |
dc.creator | Ioannou, Petros A. | en |
dc.date.accessioned | 2019-12-02T10:34:14Z | |
dc.date.available | 2019-12-02T10:34:14Z | |
dc.date.issued | 2008 | |
dc.identifier.issn | 1366-5545 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/56581 | |
dc.description.abstract | This paper studies substitution between empty containers of different types in an attempt to reduce the cost of empty container interchange. Since finding an optimal solution requires substantial computational efforts, a heuristic method is developed which yields an integer solution relatively fast. The developed methodology divides the problem into dependent and independent parts and applies a branch-and-bound procedure to the dependent part. Available data from the combined Los Angeles and Long Beach ports are used to evaluate the proposed technique. Computational tests are used to demonstrate the efficiency of the developed method in terms of computational time and solution quality. © 2007 Elsevier Ltd. All rights reserved. | en |
dc.source | Transportation Research Part E: Logistics and Transportation Review | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-35648968559&doi=10.1016%2fj.tre.2007.07.001&partnerID=40&md5=1c2dc2fedb462470e2e2b72485901bac | |
dc.subject | United States | en |
dc.subject | North America | en |
dc.subject | planning method | en |
dc.subject | Los Angeles | en |
dc.subject | California | en |
dc.subject | container terminal | en |
dc.subject | efficiency measurement | en |
dc.subject | Empty container reuse | en |
dc.subject | heuristics | en |
dc.subject | Long Beach | en |
dc.subject | Los Angeles and Long Beach port area | en |
dc.subject | Multi-commodity substitution problem | en |
dc.title | A heuristic solution for the empty container substitution problem | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1016/j.tre.2007.07.001 | |
dc.description.volume | 44 | |
dc.description.issue | 2 | |
dc.description.startingpage | 203 | |
dc.description.endingpage | 216 | |
dc.author.faculty | Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Μαθηματικών και Στατιστικής / Department of Mathematics and Statistics | |
dc.type.uhtype | Article | en |
dc.source.abbreviation | Transp.Res.Part E Logist.Transp.Rev. | en |
dc.contributor.orcid | Ioannou, Petros A. [0000-0001-6981-0704] | |
dc.gnosis.orcid | 0000-0001-6981-0704 | |