Treffer: Liner shipping network design with deadlines
Title:
Liner shipping network design with deadlines
Authors:
Source:
Computers & operations research. 41:140-149
Publisher Information:
Kidlington: Elsevier, 2014.
Publication Year:
2014
Physical Description:
print, 35 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Gestion des stocks, gestion de la production. Distribution, Inventory control, production control. Distribution, Transports terrestres, transports aeriens, transports maritimes, constructions navales, Ground, air and sea transportation, marine construction, Transports et trafic maritimes et fluviaux, Marine and water way transportation and traffic, Conteneur, Container, Contenedor, Date limite, Deadline, Fechas últimas, Efficacité, Efficiency, Eficacia, Génération colonne, Column generation, Generación columna, Modèle non linéaire, Non linear model, Modelo no lineal, Méthode heuristique, Heuristic method, Método heurístico, Navire porte conteneur, Container ship, Buque porta containers, Optimisation, Optimization, Optimización, Problème NP difficile, NP hard problem, Problema NP duro, Production à la commande, Make to order, Producción flujo tirado, Programmation linéaire, Linear programming, Programación lineal, Programmation non convexe, Non convex programming, Programación no convexa, Programmation non linéaire, Non linear programming, Programación no lineal, Programmation partiellement en nombres entiers, Mixed integer programming, Programación mixta entera, Rue, Street, Calle, Réseau transport, Transportation network, Red transporte, Résolution problème, Problem solving, Resolución problema, Temps parcours, Transit time, Tiempo recorrido, Terminal portuaire, Port terminal, Terminal portuario, Transport maritime, Maritime transportation, Transporte marítimo, Liner shipping network design, NP-hard
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
School of Mathematics and Applied Statistics, University of Wollongong, Wollongong, NSW 2522, Australia
Department of Civil and Environmental Engineering, National University of Singapore, Singapore 117576, Singapore
Department of Civil and Environmental Engineering, National University of Singapore, Singapore 117576, Singapore
ISSN:
0305-0548
Rights:
Copyright 2014 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Building. Public works. Transport. Civil engineering
Operational research. Management
Operational research. Management
Accession Number:
edscal.27868561
Database:
PASCAL Archive
Weitere Informationen
It is crucial for a liner shipping company to design its container shipping network. Given a set of port-to-port container shipment demands with delivery deadlines, the liner shipping company aims to design itineraries of portcalls, deploy ships on these itineraries and determine how to transport containers with the deployed ships in order to maximize its total profit. In this paper we first demonstrate NP-hardness of this problem and subsequently formulate it as a mixed-integer non-linear non-convex programming model. A column generation based heuristic method is proposed for solving this problem. Numerical experiments for container shipping on the Asia―Europe trade lane show that the proposed solution algorithm is efficient to find good quality solutions.