Containership routing with time deadlines and simultaneous deliveries and pick-ups |
| |
Authors: | Matthew G Karlaftis Konstantinos Kepaptsoglou Evangelos Sambracos |
| |
Institution: | 1. Department of Transportation Planning and Engineering, School of Civil Engineering, National Technical University of Athens, 5, Iroon Polytechniou, 15773 Zografou Campus, Greece;2. Department of Maritime Studies, University of Piraeus, 40, Karaoli and Dimitriou, 18534 Piraeus, Greece |
| |
Abstract: | In this paper we seek to determine optimal routes for a containership fleet performing pick-ups and deliveries between a hub and several spoke ports. A capacitated vehicle routing problem with pick-ups, deliveries and time deadlines is formulated and solved using a hybrid genetic algorithm for establishing routes for a dedicated containership fleet. Results on the performance of the algorithm and the feasibility of the approach show that a relatively small fleet of containerships could provide efficient services within deadlines. Moreover, through sensitivity analysis we discuss performance robustness and consistency of the developed algorithm under a variety of problem settings and parameters values. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|