The Pickup and Delivery Problem with Shuttle routes (PDPS) is a special case of the Pickup and Delivery Problem with Time Windows (PDPTW) where the trips between the pickup points and the delivery points can be decomposed into two legs. The first leg visits only pickup points and ends at some...

This paper addresses the problem of optimizing the transportation of disabled persons from home to specialized centres or schools. It is modelled as a Dial-a-ride problem (DARP), where several people share the same destination. Particular emphasis is placed on the objective function in order to...

Supply chain network design (SCND) models and methods have been the subject of several recent literature review surveys, but none of them explicitly includes sustainable development as a main characteristic of the problem considered. The aim of this review is to bridge this gap. The paper...

This paper proposes a mixed integer linear program (MILP) for the design and planning of a production-distribution system. This study aims to help strategic and tactical decisions: opening, closing or enlargement of facilities, supplier selection, flows along the supply chain. These decisions...

This paper proposes a new heuristic method for the logistics network design and planning problem based on linear relaxation and DC (difference of convex functions) programming. We consider a multi-period, multi-echelon, multi-commodity and multi-product problem defined as a large scale mixed...

The multi-commodity network flow problem is an important sub-problem in several heuristics and exact methods for designing route networks for container ships. The sub-problem decides how cargoes should be transported through the network provided by shipping routes. This paper studies the...

In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem. More importantly we highlight the...

In this paper we consider the problem of allocating arriving ships to discrete berth locations at container terminals. This problem is recognized as one of the most important processes for any container terminal. We review and describe three main models of the discrete dynamic berth allocation...