Locating road-vehicle refueling stations

This study follows the concept of set cover for proposing a refueling-station-location model using a mixed integer programming method, based on vehicle-routing logics. Its solution uses only the easy-obtain data of the origin-destination distance matrix. A case study that focuses on the siting of refueling stations for achieving multiple origin-destination intercity travel via electric vehicles on Taiwan demonstrates the applicability of the model. Sensitivity analysis shows that greater vehicle range will result in a lower number of refueling stations that need to be sited. Range is crucial in reducing the facility-location costs, and therefore is an important issue in the development of alternative-fuel-vehicle technology.     

Berth scheduling by customer service differentiation: A multi-objective approach

In this paper the discrete and dynamic berth allocation problem is formulated as a multi-objective combinatorial optimization problem where vessel service is differentiated upon based on priority agreements. A genetic algorithms based heuristic is developed to solve the resulting problem. A number of numerical experiments showed that the heuristic performed well in solving large, real life instances. The heuristic provided a complete set of solutions that enable terminal operators to evaluate various berth scheduling policies and select the schedule that improves operations and customer satisfaction. The proposed algorithm outperformed a state of the art metaheuristic and provided improved results when compared to the weighted approach.     

The simultaneous berth and quay crane allocation problem

This paper addresses efficient berth and crane allocation scheduling at a multi-user container terminal. First, we introduce a formulation for the simultaneous berth and crane allocation problem. Next, by employing genetic algorithm we develop a heuristic to find an approximate solution for the problem. The fitness value of a chromosome is obtained by crane transfer scheduling across berths, which is determined by a maximum flow problem-based algorithm based on a berth allocation problem solution defined by the chromosome. The results of numerical experiments show that the proposed heuristic is applicable to solve this difficult but essential terminal operation problem.     

A MIP model for locating slow-charging stations for electric vehicles in urban areas accounting for driver tours

In this paper we propose an improved mathematical model for locating EV charging stations. We consider the successive activities of the travelers, i.e., a person with two main stops during the day should charge the vehicle in just one of the parking spots, hence avoiding double counting the demand. The model is tested for the city of Coimbra (Portugal), where there is a network of nine stations. We conclude that our solution is better than the one that was implemented in reality, moreover we are able to conclude that demand transference has a rather significant impact on the solutions.     

Terminal and yard allocation problem for a container transshipment hub with multiple terminals

This paper presents an integer programming model for the terminal and yard allocation problem in a large container transshipment hub with multiple terminals. The model integrates two decisions: terminal allocation for vessels and yard allocation for transshipment container movements within a terminal as well as between terminals. The objective function aims to minimize the total inter-terminal and intra-terminal handling costs generated by transshipment flows. To solve the problem, we develop a 2-level heuristic algorithm to obtain high quality solutions in an efficient way. Computational experiments show the effectiveness of the proposed approach.     

Strategic design and operational management optimization of a multi stage physical distribution system

Design and management of logistic networks is one of the most critical issues in supply chain management. However, the literature does not contain any effective models, methods, and applications that simultaneously support management decisions in the strategic design of the distribution system, in the operational planning and organization of vehicles, and in container trips organization adopting different modes of transportation. The aim of this paper is to illustrate an original framework for the design and optimization of a multi echelon and multi level production/distribution system that combines mixed-integer linear programming modeling with cluster analysis, heuristic algorithms, and optimal transportation rules. A significant case study is illustrated revealing the effectiveness of the approach and tools proposed.     

Shift designs for freight handling personnel at air cargo terminals

This paper presents an integrated mixed integer linear programming (MILP) model for determining manpower requirements and related personnel shift designs for the build-up and break-down of the unit load devices (ULDs) at the air cargo terminal to minimize manpower costs. To utilize the manpower resources efficiently, we implement a new mechanism for demand leveling. In addition, we consider the qualification hierarchy between build-up and break-down workers. A case study based on the real-life data shows that the model is useful for manpower planning at air cargo terminals and the integrated approach is far superior to a traditional two-stage approach.     

Fleet deployment, network design and hub location of liner shipping companies

A mixed integer linear programming formulation is proposed for the simultaneous design of network and fleet deployment of a deep-sea liner service provider. The underlying network design problem is based on a 4-index (5-index by considering capacity type) formulation of the hub location problem which are known for their tightness. The demand is elastic in the sense that the service provider can accept any fraction of the origin–destination demand. We then propose a primal decomposition method to solve instances of the problem to optimality. Numerical results confirm superiority of our approach in comparison with a general-purpose mixed integer programming solver.