dc.contributor.author | Jula, H. | en |
dc.contributor.author | Dessouky, M. | en |
dc.contributor.author | Ioannou, Petros A. | en |
dc.contributor.author | Chassiakos, Anastassios | en |
dc.creator | Jula, H. | en |
dc.creator | Dessouky, M. | en |
dc.creator | Ioannou, Petros A. | en |
dc.creator | Chassiakos, Anastassios | en |
dc.date.accessioned | 2019-12-02T10:35:46Z | |
dc.date.available | 2019-12-02T10:35:46Z | |
dc.date.issued | 2005 | |
dc.identifier.issn | 1366-5545 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/56983 | |
dc.description.abstract | Container movement by trucks with time constraints at origins and destinations is modeled as an asymmetric "multi-Traveling Salesmen Problem with Time Windows" (m-TSPTW) with social constraints. A two-phase exact algorithm based on dynamic programming (DP) is proposed that finds the best routes for a fleet of trucks. Since the m-TSPTW problem is NP-hard, the computational time for optimally solving large size problems becomes prohibitive. For large size problems, we develop a hybrid methodology consisting of DP in conjunction with genetic algorithms. The developed algorithms are compared with an insertion heuristic method. Computational results demonstrate the efficiency of the developed algorithms. © 2004 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-13144307178&doi=10.1016%2fj.tre.2004.03.003&partnerID=40&md5=8ac3ce6e22dda9f0266e300dac189ff8 | |
dc.subject | modeling | en |
dc.subject | Dynamic programming | en |
dc.subject | algorithm | en |
dc.subject | Genetic algorithms | en |
dc.subject | Heuristic | en |
dc.subject | heuristics | en |
dc.subject | cargo handling | en |
dc.subject | Container movement | en |
dc.subject | metropolitan area | en |
dc.subject | Time windows | en |
dc.subject | Traveling salesman problem | en |
dc.subject | trucking | en |
dc.title | Container movement by trucks in metropolitan networks: Modeling and optimization | en |
dc.type | info:eu-repo/semantics/article | |
dc.identifier.doi | 10.1016/j.tre.2004.03.003 | |
dc.description.volume | 41 | |
dc.description.issue | 3 | |
dc.description.startingpage | 235 | |
dc.description.endingpage | 259 | |
dc.author.faculty | Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Μαθηματικών και Στατιστικής / Department of Mathematics and Statistics | |
dc.type.uhtype | Article | en |
dc.description.notes | <p>Cited By :69</p> | 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 | |