A differential evolution approach for the vehicle routing problem with backhauls and time windows

This paper presents a differential evolution algorithm (DEA) to solve a vehicle routing problem with backhauls and time windows (VRPBTW) and applied for a catering firm. VRPBTW is an extension of the vehicle routing problem, which includes capacity and time window constraints. In this problem, customers are divided into two subsets: linehaul and backhaul. Each vehicle starts from a depot and goods are delivered from the depot to the linehaul customers. Goods are subsequently brought back to the depot from the backhaul customers. The objective is to minimize the total distance that satisfies all of the constraints. The problem is formulated using mixed integer programming and solved using DEA. Proposed algorithm is tested with several benchmark problems to demonstrate effectiveness and efficiency of the algorithm and results show that our proposed algorithm can find superior solutions for most of the problems in comparison with the best known solutions. Hence, DEA was carried out for catering firm to minimize total transportation costs. Copyright © 2013 John Wiley & Sons, Ltd.     

An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations

The consideration of pollution in routing decisions gives rise to a new routing framework where measures of the environmental implications are traded off with business performance measures. To address this type of routing decisions, we formulate and solve a bi-objective time, load and path-dependent vehicle routing problem with time windows (BTL-VRPTW). The proposed formulation incorporates a travel time model representing realistically time varying traffic conditions. A key feature of the problem under consideration is the need to address simultaneously routing and path finding decisions. To cope with the computational burden arising from this property of the problem we propose a network reduction approach. Computational tests on the effect of the network reduction approach on determining non-dominated solutions are reported. A generic solution framework is proposed to address the BTL-VRPTW. The proposed framework combines any technique that creates capacity-feasible routes with a routing and scheduling method that aims to convert the identified routes to problem solutions. We show that transforming a set of routes to BTL-VRPTW solutions is equivalent to solving a bi-objective time dependent shortest path problem on a specially structured graph. We propose a backward label setting technique to solve the emerging problem that takes advantage of the special structure of the graph. The proposed generic solution framework is implemented by integrating the routing and scheduling method into an Ant Colony System algorithm. The accuracy of the proposed algorithm was assessed on the basis of its capability to determine minimum travel time and fuel consumption solutions. Although the computational results are encouraging, there is ample room for future research in algorithmic advances on addressing the proposed problem.     

Identification of vehicle sensor locations for link-based network traffic applications

Information on link flows in a vehicular traffic network is critical for developing long-term planning and/or short-term operational management strategies. In the literature, most studies to develop such strategies typically assume the availability of measured link traffic information on all network links, either through manual survey or advanced traffic sensor technologies. In practical applications, the assumption of installed sensors on all links is generally unrealistic due to budgetary constraints. It motivates the need to estimate flows on all links of a traffic network based on the measurement of link flows on a subset of links with suitably equipped sensors. This study, addressed from a budgetary planning perspective, seeks to identify the smallest subset of links in a network on which to locate sensors that enables the accurate estimation of traffic flows on all links of the network under steady-state conditions. Here, steady-state implies that the path flows are static. A “basis link” method is proposed to determine the locations of vehicle sensors, by using the link-path incidence matrix to express the network structure and then identifying its “basis” in a matrix algebra context. The theoretical background and mathematical properties of the proposed method are elaborated. The approach is useful for deploying long-term planning and link-based applications in traffic networks.     

A hybrid Genetic Algorithm approach to minimize the total joint cost of a single-vendor multi-customer integrated scheduling problem

This paper addresses the scheduling of supply chains with interrelated factories consisting of a single vendor and multiple customers. In this research, one transporter is available to deliver jobs from vendor to customers, and the jobs can be processed by batch. The problem studied in this paper focuses on a real-case scheduling problem of a multi-location hospital supplied with a central pharmacy. The objective of this work is to minimize the total cost, while satisfying the customer’s due dates constraints. A mathematical formulation of the problem is given as a Mixed Integer Programming model. Then, a Branch-and-Bound algorithm is proposed as an exact method for solving this problem, a greedy local search is developed as a heuristic approach, and a hybrid Genetic Algorithm is presented as a meta-heuristic. Computation experiments are conducted to highlight the performance of the proposed methods.     

A statistical approach to the traveling salesman problem

A statistical approach is shown to be adaptable to the N-city traveling salesman problem by considering route distances to be random variables which are continuous and normally distributed. A solution to the shortest route distance and path can be approximated by utilizing a Monte Carlo simulation to obtain a representative sample of possible journeys. The approach involves recursive statistical inference which is used to select next-city visits leading to the most probable minimum route path. A statistical selection of the minimum route path is computationally efficient and computer run time increases in proportion to the square of the number of cities as opposed to an (N - 1)! increase for a deterministic approach. The accuracy of the statistical approach is directly proportional to the number of Monte Carlo simulations.     

Heuristic approach to the airline schedule disturbances problem

Abstract

When disturbances make it impossible to realise the planned flight schedule, the dispatcher at the airline operational centre defines a new flight schedule based on airline policy, in order to reduce the negative effects of these perturbations. Depending on airline policy, when designing the new flight schedule, the dispatcher delays or cancels some flights and reassigns some flights to available aircraft. In this paper, a decision support system (DSS) for solving the airline schedule disturbances problem is developed aiming to assist decision makers in handling disturbances in real-time. The system is based on a heuristic algorithm, which generates a list of different feasible schedules ordered according to the value of an objective function. The dispatcher can thus select and implement one of them. In this paper, the possibilities of DSS are illustrated by real numerical examples that concern JAT Airways' flight schedule disturbances.     

FMOLP approach to the inland water transportation problem

Fuzzy optimization techniques can be applied in determining the optimal schedule for the transport of gravel by inland water transportation. Gravel demand, for example, is difficult to determine precisely since it depends on the industrial development of the regions supplied by gravel and on possible buyers. The duration of the annual navigation period varies depending on the water level, possible icebergs, heavy fog, strong and frequent wind. The transport company is usually satisfied if total transportation costs stay within a reasonable range. The formulation of a linear programme lacks flexibility in dealing with imprecise input data. In this paper this type of problem has been approached with fuzzy optimization techniques.     

A graphical approach to identify sensor locations for link flow inference

Information of link flows in a traffic network becomes increasingly critical in contemporary transportation practice and researches. The network sensor installation is carried out to supply such information. In this paper, we present a graphical approach to determine the smallest subset of links in a traffic network for counting sensor installation, so as to infer the flows on all remaining links. The elegant assumption-free character of the problem introduced by Hu, Peeta and Chu is still kept in this approach. This study points out the topological tree feature of solutions that makes it possible for traffic management agencies to easily and flexibly select links for sensor installation in practice. Addressing from the same graphical perspective, we provide solutions to four other important problems about sensor locations. The preceding two problems are, in traffic networks that already have sensors installed on some links, to identify the subset of links on which link flows can be inferred from sensor measurements and to determine the smallest subset of links on which counting sensors also need to be installed so as to infer link flows on all remaining non-equipped links. The third is to identify the optimal locations for a given number of sensors so as to infer flows on as many links as possible by gradually enlarging the number of links included in circuits. The last one is to determine the smallest subset of links on which to install sensors, in such a way that it becomes possible at the same time to satisfy prior requirements and infer the flows on all remaining links, through building a minimum spanning tree. These methods can be applied to all kinds of long-term planning and link-based applications in traffic networks.     

On the dual approach to the traffic assignment problem

This paper attempts to explore the possibility of solving the traffic assignment problem with elastic demands by way of its dual problem. It is shown that the dual problem can be formulated as a nonsmooth convex optimization problem of which the objective function values and subgradients are conveniently calculated by solving shortest path problems associated with the transportation network. A subgradient algorithm to solve the dual problem is presented and limited computational experience is reported. The computational results are encouraging enough to demonstrate the effectiveness of the proposed approach.     

Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm

The delivery service provided by large-scale retailers continues to grow as online sales occupy an increasingly large share of the market. This study aims to tease out efficient vehicle scheduling times as well as optimal delivery routes by applying meta-heuristic algorithms. Monthly data on existing routes were obtained from a branch of Korea’s leading large-scale online retailer. The first task was to examine the status of existing routes by comparing delivery routes created using Dijkstra’s algorithm with existing delivery routes and their vehicle scheduling. The second task was to identify optimal delivery routes through a comparative analysis of the genetic algorithm and Tabu search algorithm, known for its superior applicability amongst other meta-heuristic algorithms. These findings demonstrate that the optimal vehicle routing problem not only has the potential to reduce distribution costs for operators and expedite delivery for consumers, but also the added social benefit of reduced carbon emissions.     

Approximate algorithms for the discrete network design problem

The discrete network design problem is one of finding a set of feasible actions (projects) from among a collection of possible actions, that when implemented, optimizes some objective function(s). This is a combinatorial optimization problem that is very expensive to solve exactly. This paper proposes two algorithms for obtaining approximate solutions to the discrete network design problem with much less computational effeort. The computational savings are achieved by approximating the original problem with a new formulation which is easier to solve. The first algorithm proposed solves this approximate problem exactly, while the second is even more efficient, but provides only a near-optimal solution to the approximate problem. Experience with test problems indicates that these approximations can reduce the computational effort by a factor of 3–5, with little loss in solution accuracy.     

A disjunctive convex programming approach to the pollution-routing problem

The pollution-routing problem (PRP) aims to determine a set of routes and speed over each leg of the routes simultaneously to minimize the total operational and environmental costs. A common approach to solve the PRP exactly is through speed discretization, i.e., assuming that speed over each arc is chosen from a prescribed set of values. In this paper, we keep speed as a continuous decision variable within an interval and propose new formulations for the PRP. In particular, we build two mixed-integer convex optimization models for the PRP, by employing tools from disjunctive convex programming. These are the first arc-based formulations for the PRP with continuous speed. We also derive several families of valid inequalities to further strengthen both models. We test the proposed formulations on benchmark instances. Some instances are solved to optimality for the first time.     

A complex network approach to understand commercial vehicle movement

We introduce complex network analysis and use a commercial vehicle’s observed trip as a proxy for a business relation between two facilities in its activity chain. We extract facility locations by applying density-based clustering to GPS data of commercial vehicle activities. The network among the facilities is then extracted by analysing the activity chains of more than 25,000 commercial vehicles. Centrality metrics prove useful and novel in identifying and locating key logistics players. Transport planners and decision makers can benefit from such an approach as it allows them to design more targeted initiatives and policy interventions.     

A corridor-centric approach to planning electric vehicle charging infrastructure

The transition to electric vehicles (EV) faces two major barriers. On one hand, EV batteries are still expensive and limited by range, owing to the lack of technology breakthrough. On the other hand, the underdeveloped supporting infrastructure, particularly the lack of fast refueling facilities, makes EVs unsuitable for medium and long distance travel. The primary purpose of this study is to better understand these hurdles and to develop strategies to overcome them. To this end, a conceptual optimization model is proposed to analyze travel by EVs along a long corridor. The objective of the model is to select the battery size and charging capacity (in terms of both the charging power at each station and the number of stations needed along the corridor) to meet a given level of service in such a way that the total social cost is minimized. Two extensions of the base model are also considered. The first relaxes the assumption that the charging power at the stations is a continuous variable. The second variant considers battery swapping as an alternative to charging. Our analysis suggests that (1) the current paradigm of charging facility development that focuses on level 2 charging delivers poor level of service for long distance travel; (2) the level 3 charging method is necessary not only to achieve a reasonable level of service, but also to minimize the social cost; (3) investing on battery technology to reduce battery cost is likely to have larger impacts on reducing the charging cost; and (4) battery swapping promises high level of service, but it may not be socially optimal for a modest level of service, especially when the costs of constructing swapping and charging stations are close.     

The influences of past and present residential locations on vehicle ownership decisions

This study explores the relationship between historical exposure to the built environment and current vehicle ownership patterns. The influence of past exposure to the built environment on current vehicle ownership decisions may be causal, but there are alternative explanations. Households may primarily select to live in neighborhoods that facilitate their vehicle ownership preferences, or they may retain preferences that they have developed in the past, irrespective of their current situations. This study seeks to control for these alternative explanations by including the built environment attributes of households’ past residences as an influence on vehicle ownership choices. We use a dataset from a credit reporting firm that contains up to nine previous residential ZIP codes for households currently living in the 13-county Atlanta, Georgia, metropolitan area. Results show that past location is significant, but of marginal influence relative to the attributes of the current location. From a practical perspective, our results suggest that models that include current but not past neighborhood attributes (also controlling for standard socioeconomic variables) can forecast vehicle ownership decisions reasonably well. However, models that include both current and past neighborhood attributes can provide a more nuanced understanding of the built environment’s potentially causal influences on vehicle ownership decisions. This better understanding may provide more realistic forecasts of responses to densification or other travel demand management strategies.     

Experimental validation of connected automated vehicle design among human-driven vehicles

In this paper, we present results regarding the experimental validation of connected automated vehicle design. In order for a connected automated vehicle to integrate well with human-dominated traffic, we propose a class of connected cruise control algorithms with feedback structure originated from human driving behavior. We test the connected cruise controllers using real vehicles under several driving scenarios while utilizing beyond-line-of-sight motion information obtained from neighboring human-driven vehicles via vehicle-to-everything (V2X) communication. We experimentally show that the design is robust against variations in human behavior as well as changes in the topology of the communication network. We demonstrate that both safety and energy efficiency can be significantly improved for the connected automated vehicle as well as for the neighboring human-driven vehicles and that the connected automated vehicle may bring additional societal benefits by mitigating traffic waves.     

Evaluating the effects of automated vehicle technology on the capacity of freeway weaving sections

Weaving sections, where a merge and a diverge are in close proximity, are considered as crucial bottlenecks in the highway network. Lane changes happen frequently in such sections, leading to a reduced capacity and the traffic phenomenon known as capacity drop. This paper studies how the emerging automated vehicle technology can improve the operations and increase the capacity of weaving sections. We propose an efficient yet effective multiclass hybrid model that considers two aspects of this technology in scenarios with various penetration rates: (i) the potential to control the desired lane change decisions of automated vehicles, which is represented in a macroscopic manner as the distribution of lane change positions, and (ii) the lower reaction time associated with automated vehicles that can reduce headways and the required gaps for lane changing maneuvers. The proposed model is successfully calibrated and validated with empirical observations from conventional vehicles at a weaving section near the city of Basel, Switzerland. It is able to replicate traffic dynamics in weaving sections including the capacity drop. This model is then applied in a simulation-based optimization framework that searches for the optimal distribution of the desired lane change positions to maximize the capacity of weaving sections. Simulation results show that by optimizing the distribution of the desired lane change positions, the capacity of the studied weaving section can increase up to 15%. The results also indicate that if the reaction time is considered as well, there is an additional combined effect that can further increase the capacity. Overall, the results show the great potential of the automated vehicle technology for increasing the capacity of weaving sections.     

Fuzzy modeling approach to the rail freight car inventory problem

Techniques to improve freight car fleet use are of considerable interest to the railroad industry. In this paper, we present a fuzzy inventory control approach applied to the sizing of empty cars on a rail network. We address the problem of deciding the optimal inventory level and the optimal ordering quantity for a rail freight car fleet system in which demand and travel time are uncertain variables represented as triangular fuzzy numbers. Based on the fuzzy economic order quantity (EOQ) formula, a modified fuzzy EOQ model is set up and the optimal policy is developed using the signed distance method to defuzzify the fuzzy total cost. Computational results made for the Serbian rail network case verify the proposed model as well as the efficiency of the approach.     

Optimal locations of electric public charging stations using real world vehicle travel patterns

We propose an optimization model based on vehicle travel patterns to capture public charging demand and select the locations of public charging stations to maximize the amount of vehicle-miles-traveled (VMT) being electrified. The formulated model is applied to Beijing, China as a case study using vehicle trajectory data of 11,880 taxis over a period of three weeks. The mathematical problem is formulated in GAMS modeling environment and Cplex optimizer is used to find the optimal solutions. Formulating mathematical model properly, input data transformation, and Cplex option adjustment are considered for accommodating large-scale data. We show that, compared to the 40 existing public charging stations, the 40 optimal ones selected by the model can increase electrified fleet VMT by 59% and 88% for slow and fast charging, respectively. Charging demand for the taxi fleet concentrates in the inner city. When the total number of charging stations increase, the locations of the optimal stations expand outward from the inner city. While more charging stations increase the electrified fleet VMT, the marginal gain diminishes quickly regardless of charging speed.     

运用QC方法解决管片生产质量问题

武汉长江隧道钢筋混凝土管片在开始生产之前,成立了QC质量攻关小组。小组运用QC方法,严格按照PDCA循环步骤,针对在管片生产过程中出现的质量问题,进行了大量的试验、研究及摸索,并采取有效措施对混凝土配合比及生产工艺等方面进行了改进,最终成功解决了质量问题。