Approximating multi-objective time-dependent optimization problems

In many practical situations, decisions are multi-objective in nature. Furthermore, costs and profits are time-dependent, i.e. depending upon the time a decision is taken, different costs and profits are incurred. In this paper, we propose a generic approach to deal with multi-objective time-dependent optimization problems (MOTDP). The aim is to determine the set of Pareto solutions that capture the interactions between the different objectives. Due, to the complexity of MOTDP, an efficient approximation based on dynamic programming is developed. The approximation has a provable worst case performance guarantee. Even though the approximate Pareto set consists of less solutions, it represents a good coverage of the true set of Pareto solutions. Numerical results are presented showing the value of the approximation

The time-dependent vehicle routing problem with soft time windows and stochastic travel times

This paper studies a vehicle routing problem with time-dependent and stochastic travel times. In our problem setting, customers have soft time windows. A mathematical model is used in which both efficiency for service as well as reliability for customers are taken into account. Depending on whether service times are included or not, we consider two versions of this problem. Two metaheuristics are built: a Tabu Search and an Adaptive Large Neighborhood Search. We carry out our experiments for well-known problem instances and perform comprehensive analyses on the numerical results in terms of the computational time and the solution quality. Experiments confirm that the proposed procedure is effective to obtain very good solutions to be performed in real-life environment

Generating greenhouse gas cutting incentives when allocating carbon dioxide emissions to shipments in road freight transportation

Road freight transportation accounts for a great share of the anthropogenic greenhouse gas (GHG) emissions. In order to provide a common methodology for carbon accounting related to transport activities, the European Committee for Standardization has published the European Norm EN-16258. Unfortunately, EN-16258 contains gaps and ambiguities and leaves room for interpretation, which makes the comparison of the environmental performance of different logistics networks still difficult and hinders the identification of best practices. This research contributes to the identification of particularly meaningful principles for the allocation of GHG to shipments in road freight transportation by presenting an analytical framework for studying the performance of the EN-16258 allocation schemes with respect to accuracy, fairness, and the GHG minimizing incentive. In doing so, we continue previous studies that analyzed two important aspects of the EN-16258 allocation rules: accuracy and fairness. This study provides further insights into this allocation problem by investigating the incentive power of the different allocation schemes to opt for the GHG minimal way of running a road freight network. First, we complement the list of transport scenarios introduced in prior studies and present two novel scenarios. Second, we carry out a series of numerical experiments to compare the EN-16258 allocation rules with respect to accuracy, fairness, and the GHG minimizing incentive. We find that the results may differ significantly for the two scenarios, suggesting a case-by-case recommendation. This is particularly interesting because the first scenario confirms the results of the prior studies, while the second scenario rather contradicts them

A concise guide to existing and emerging vehicle routing problem variants

Vehicle routing problems have been the focus of extensive research over the past sixty years, driven by their economic importance and their theoretical interest. The diversity of applications has motivated the study of a myriad of problem variants with different attributes. In this article, we provide a concise overview of existing and emerging problem variants. Models are typically refined along three lines: considering more relevant objectives and performance metrics, integrating vehicle routing evaluations with other tactical decisions, and capturing fine-grained yet essential aspects of modern supply chains. We organize the main problem attributes within this structured framework. We discuss recent research directions and pinpoint current shortcomings, recent successes, and emerging challenges

A machine learning approach for allocating route cost to customers for transportation and logistics services.

Advancements in big data enabled management practices inspire logistics companies to study deeper into their transportation operations with a data driven approach. One such question asks: How can a logistics firm identify high-cost customers in their service network? In the presence of rich data on routes involving many customers, this thesis develops a framework to allocate a route cost among customers that the route serves, where each route is associated with multiple route features related to the transportation cost. Cost is allocated using the proportional allocation approach in combination with the random forest method in machine learning. First, this framework ensembles random forest regression models to determine the importance values of all route features. Next, the importance values of route features are used to allocate cost among customers. Finally, posterior analysis identifies customers in a route or in general that are most costly to serve. Several additional analyses are performed to show potential uses of this cost allocation output. Results of the framework and analyses on three simulated case and two industry cases show the validity of the model and the potential for actionable operational analysis and changes

A decision support system for goods distribution planning in urban areas

Efficient goods distribution planning is vital to ensure high business revenues for logistics operators and minimize negative impacts on the environment. In this thesis, we address three main problems related to goods distribution planning in urban areas namely customer allocation, order scheduling, and vehicle routing. A three step approach is proposed. In the first step, we use Nearest Neighbour and Tabu Search for balanced allocation of customers to logistics depots. In the second step, Genetic Algorithm approach is used to perform order scheduling at each depot for the allocated customers. In the third and the last step, we perform vehicle allocations and generate fastest paths for goods delivery to customers using modified Dijkstra’s algorithm. All these decisions are made considering realistic conditions associated with goods distribution in urban areas such as presence of congestion, municipal regulations, for example vehicle sizing, timing and access regulations etc. The objective is to minimize total distribution costs of logistics operators under these constraints. A prototype decision support system is developed integrating the proposed approaches for goods distribution planning in urban areas. The strength of the proposed decision support system is its ability to generate fast and efficient solutions for balanced customer allocation, dynamic order scheduling, vehicle allocation considering environmental constraints and fastest path generation under dynamic traffic conditions. The proposed model results are verified and validated against other standard approaches available in literature

Shadow Price Guided Genetic Algorithms

The Genetic Algorithm (GA) is a popular global search algorithm. Although it has been used successfully in many fields, there are still performance challenges that prevent GA’s further success. The performance challenges include: difficult to reach optimal solutions for complex problems and take a very long time to solve difficult problems. This dissertation is to research new ways to improve GA’s performance on solution quality and convergence speed. The main focus is to present the concept of shadow price and propose a two-measurement GA. The new algorithm uses the fitness value to measure solutions and shadow price to evaluate components. New shadow price Guided operators are used to achieve good measurable evolutions. Simulation results have shown that the new shadow price Guided genetic algorithm (SGA) is effective in terms of performance and efficient in terms of speed