Planning and managing intermodal transportation of hazardous materials with capacity selection and congestion

The current literature in the rail–truck intermodal transportation of hazardous materials (hazmat) domain ignores congestion at intermodal yards. We attempt to close that gap by proposing a bi-objective optimization framework for managing hazmat freight that not only considers congestion at intermodal yards, but also determines the appropriate equipment capacity. The proposed framework, i.e., a non-linear MIP and a multi-objective genetic algorithm based solution methodology, is applied to a realistic size problem instance from existing literature. Our analysis indicates that terminal congestion risk is a significant portion of the network risk; and, that policies and tools involving number of cranes, shorter maximum waiting times, and tighter delivery times could have a positive bearing on risk.     

Optimal traffic calming: A mixed-integer bi-level programming model for locating sidewalks and crosswalks in a multimodal transportation network to maximize pedestrians’ safety and network usability

We study the effect that installing sidewalks and crosswalks, as traffic calming facilities, has on the safety and usability of a transportation network with automobile, public transit and walking as modes of transportation. A mathematical programming model is proposed for this problem whose objective is to minimize the safety hazard for pedestrians and the total transportation cost of the network. We utilize a customized greedy heuristic and a simulated annealing algorithm for solving the problem. The computational results indicate that installing sidewalks and crosswalks at proper locations can reduce the overall transportation cost and improve pedestrians’ safety.     

A reactive tabu search algorithm for the multi-depot container truck transportation problem

A container truck transportation problem that involves multiple depots with time windows at both origins and destinations, including the reposition of empty containers, is formulated as a multi-traveling salesman problem with time windows (m-TSPTW) with multiple depots. Since the problem is NP-hard, a cluster method and a reactive tabu search (RTS) algorithm are developed to solve the problem. The two methods are compared with the mixed integer program which can be used to find optimum solutions for small size problems. The computational results show that the developed methods, particularly the RTS algorithm, can be efficiently used to solve the problem.     

A strategic planning model for the railway system accident rescue problem

The present study examines the location of emergency rescue problems for urban ambulance and railway emergency systems. The proposed model considers probabilistic rescue demand, independent busy fractions of ambulances, and the corresponding risk levels in railway segments. We formulate the proposed model using fuzzy multi-objective programming and solve it using a generic algorithm and a non-dominated sorting genetic algorithm-II. Computation results are analyzed by applying the model to a real-world Taiwan railway system. Analytical results demonstrate that a proper adjustment of the rescue resource location improves rescue effectiveness for railway rescue and urban medical service demand.     

A multi-objective sustainable load planning model for intermodal transportation networks with a real-life application

Growing importance of intermodal transportation necessitates modeling and solving load planning problems by taking into account various complex decisions simultaneously like transportation mode/service type selection, load allocation, and outsourcing. This paper presents a mixed-integer mathematical programming model for a multi-objective, multi-mode and multi-period sustainable load planning problem by considering import/export load flows to satisfy transport demands of customers and many other related issues. Several multiple objective optimization procedures are utilized in order to handle conflicting objectives simultaneously under crisp and fuzzy decision making environments. A real-life case study is also performed to present application and usefulness of the proposed model.     

Optimization models for placement of an energy-aware electric vehicle charging infrastructure

This paper addresses the problem of optimally placing charging stations in urban areas. Two optimization criteria are used: maximizing the number of reachable households and minimizing overall e-transportation energy cost. The decision making models used for both cases are mixed integer programming with linear and nonlinear energy-aware constraints. A multi-objective optimization model that handles both criteria (number of reachable households and transportation energy) simultaneously is also presented. A number of simulation results are provided for two different cities in order to illustrate the proposed methods. Among other insights, these results show that the multi-objective optimization provides improved placement results.     

用蚁群算法求解类TSP问题的研究

铁路运输调度问题能否很好解决对于铁路运输公司至关重要,旅行商问题(简称TSP)经常被用来研究运输调度问题。根据某化工集团铁路运输公司的生产实际,提出了“类TSP”问题,但由于“类TSP”和TSP有很大区别,以前求解TSP的优化算法不能直接用于“类TSP”的求解。利用蚁群算法是可以较好解决TSP的一类新型模拟进化算法,适应“类TSP”的要求,并通过“蚁后规则”和变异机制的引入,提出了一种改进的人工蚁群算法。计算机仿真结果表明该算法求解“类TSP”是行之有效的。     

A heuristic algorithm for yard truck scheduling and storage allocation problems

The yard truck scheduling and the storage allocation are two important decision problems affecting the efficiency of container terminal operations. This paper proposes a novel approach that integrates these two problems into a whole. The objective is to minimize the weighted sum of total delay of requests and the total travel time of yard trucks. Due to the intractability of the proposed problem, a hybrid insertion algorithm is designed for effective problem solutions. Computational experiments are conducted to examine the key factors of the problem and the performance of the proposed heuristic algorithm.     

A location-inventory model for large three-level supply chains

We study the location-inventory problem in three-level supply networks. Our model integrates three decisions: the distribution centers location, flows allocation, and shipment sizes. We propose a nonlinear continuous formulation, including transportation, fixed, handling and holding costs, which decomposes into a closed-form equation and a linear program when the DC flows are fixed. We thus develop an iterative heuristic that estimates the DC flows a priori, solves the linear program, and then improves the DC flow estimations. Extensive numerical experiments show that the approach can design large supply networks both effectively and efficiently, and a case study is discussed.     

Container fleet sizing and empty repositioning in liner shipping systems

This paper considers the joint container fleet sizing and empty container repositioning problem in multi-vessel, multi-port and multi-voyage shipping systems with dynamic, uncertain and imbalanced customer demands. The objective is to minimize the expected total costs including inventory-holding costs, lifting-on/lifting-off costs, transportation costs, repositioning costs, and lost-sale penalty costs. A simulation-based optimization tool is developed to optimize the container fleet size and the parameterized empty repositioning policy simultaneously. The optimization procedure is based on Genetic Algorithms and Evolutionary Strategy combined with an adjustment mechanism. Case studies are given to demonstrate the results.     

An approximation approach to a trade-off among efficiency,efficacy, and balance for relief pre-positioning in disaster management

This work develops a multi-objective, two-stage stochastic, non-linear, and mixed-integer mathematical model for relief pre-positioning in disaster management. Improved imbalance and efficacy measures are incorporated into the model based on a new utility level of the delivered relief commodities. This model considers the usage possibility of a set of alternative routes for each of the applied transportation modes and consequently improves the network reliability. An integrated separable programming-augmented ε-constraint approach is proposed to address the problem. The best Pareto-optimal solution is selected by PROMETHEE-II. The theoretical improvements of the presented approach are validated by experiments and a real case study.     

Empty container management for intermodal transportation networks

We present a computational analysis of the effect of planning horizon length on empty container management for intermodal transportation networks. The analysis is based on an integer program that seeks to minimize total costs related to moving empty containers, subject to meeting requirements for moving loaded containers. A case study of potential container-on-barge operations within the Mississippi River basin illustrates the effects of planning horizon length on mode selection. A longer planning horizon can encourage the use of inexpensive, slow transportation modes, such as barge. The impact depends on the number and location of container storage pools.     

Improved approaches to the network design problem in regional hazardous waste management systems

This paper investigates the network design problem arising from the regional hazardous waste management system. The problem is to identify the locations of various waste facilities, and determine the transportation routes of hazardous wastes and waste residues between those waste facilities. Aiming at minimizing jointly the total cost and total risk, the problem is formulated as a multi-objective mixed integer linear programming model. By exploiting the advantages of the model, three multi-objective optimization approaches are customized to find highly qualified non-dominated solutions. The effectiveness and efficiency of the approaches are examined both on a hypothetical case and a realistic case.     

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.     

Measuring the perceived container leasing prices in liner shipping network design with empty container repositioning

This paper aims to measure the perceived container leasing prices at different ports by presenting a two-stage optimization method. In stage I, we propose a practical liner shipping network design problem with empty container repositioning. The proposed problem further considers the use of foldable containers and allows the mutual substitution between empty containers to decrease the number of empty containers to be repositioned. In stage II, the inverse optimization technique is used to determine the perceived container leasing prices at different ports, based on the solution obtained in stage I. Based on a set of candidate liner shipping service routes, a mixed-integer nonlinear programming model is built for the proposed problem in stage I. The nonlinear terms are linearized by introducing the auxiliary variables. Numerical experiments based on a realistic Asia-Europe-Oceania liner shipping network are carried out to account for the effectiveness of our two-stage optimization method.     

A multi-population genetic algorithm for transportation scheduling

This study considers the integration of production and transportation scheduling in a two-stage supply chain environment. The objective function minimizes the total tardiness and total deviations of assigned work loads of suppliers from their quotas. After modeling the problem as a mixed integer programming problem, a genetic algorithm with three populations, namely, a multi-society genetic algorithm (MSGA), is proposed for solving it. MSGA is compared with the optimum solutions for small problems and a heuristic and a random search approach for larger problems. Additionally, an MSGA is compared with a generic genetic algorithm. The experimental results show the superiority of the MSGA.     

Introducing endogenous transport provision in a LUTI model to explore polycentric governance systems

Models focusing on interactions between land-use and transportation mostly assume an exogenous provision of transportation infrastructures. We investigate here co-evolutionary processes between land-use and transportation, at the scale of Mega-City Regions, by introducing a toy model of corresponding processes. In particular, our model is specifically tailored to include governance processes ruling the growth of transportation infrastructure. We show through stylised numerical simulations the potentialities of our model to reproduce a variety of dynamics when co-evolution is taken into account. We then apply the model to a case study, by calibrating it for the Pearl River Delta Mega-city Region (China, 1990–2010). To go beyond this first modelling step, we elaborate on the challenges to overcome to go further towards more complex models integrating co-evolution between transportation networks and territories in urban systems.     

Criteria selection and multi-objective optimization of aircraft landing problem

Inspired by the similarities of the aircraft landing problem (ALP) and the single machine scheduling problem, we propose a criteria selection method that has been used successfully in the single machine scheduling problem to determine appropriate objective functions of ALP. First, for four different types of criteria—min-max, min-sum, completion time related, and due-dates related criteria—their corresponding physical meanings in ALP are elaborated. Then, a criteria selection method is proposed to determine several appropriate criteria, which are taken as the multi-objective while modeling ALP. Different solution algorithms, including Imperialist Competitive Algorithm (ICA), are adopted to solve the multi-objective ALP. Finally, the performance of the proposed model and method are evaluated using a set of benchmark instances. The computational results demonstrate the efficiency of our approach for solving ALP, which can simultaneously improve punctual performance, enhance runway utilization, reduce air traffic controller workload, and maintain equity among airlines.     

A hybrid multi-objective approach to capacitated facility location with flexible store allocation for green logistics modeling

We propose an efficient evolutionary multi-objective optimization approach to the capacitated facility location–allocation problem (CFLP) for solving large instances that considers flexibility at the allocation level, where financial costs and CO₂ emissions are considered simultaneously. Our approach utilizes suitably adapted Lagrangian Relaxation models for dealing with costs and CO₂ emissions at the allocation level, within a multi-objective evolutionary framework at the location level. Thus our method assesses the robustness of each location solution with respect to our two objectives for customer allocation. We extend our exploration of selected solutions by considering a range of trade-offs for customer allocation.     

Pareto efficient allocation of an in-motion wireless charging infrastructure for electric vehicles in a multipath network

Electric vehicles (EV) use an eco-friendly technology that limits the greenhouse gas emissions of the transport sector, but the limited battery capacity and the density of the battery are the major barriers to the widespread adoption of EV. To mitigate this, a good method seems to be the innovative wireless charging technology called ‘On-Line EV (OLEV)’, which is a contactless electric power transfer technology. This EV technology has the potential to charge the vehicle’s battery dynamically while the vehicle is in motion. This system helps to reduce not only the size of the battery but also its cost, and it also contributes to extending the driving range before the EV has to stop. The high cost of this technology requires an optimal location of the infrastructure along the route. For this reason, the objective of this paper is to study the problem of the location of the wireless charging infrastructure in a transport network composed of multiple routes between the origin and the destination. To find a strategic solution to this problem, we first and foremost propose a nonlinear integer programming solution to reach a compromise between the cost of the battery, which is related to its capacity, and the cost of installing the power transmitters, while maintaining the quality of the vehicle’s routing. Second, we adapt the multi-objective particle swarm optimization (MPSO) approach to our problem, as the particles were robust in solving nonlinear optimization problems. Since we have a multi-objective problem with two binary variables, we combine the binary and discrete versions of the particle swarm optimization approach with the multi-objective one. The port of Le Havre is presented as a case study to illustrate the proposed methodology. The results are analyzed and discussed in order to point out the efficiency of our resolution method.