Workload Equity in Vehicle Routing Problems: A Survey and Analysis

Over the past two decades, equity aspects have been considered in a growing number of models and methods for vehicle routing problems (VRPs). Equity concerns most often relate to fairly allocating workloads and to balancing the utilization of resources, and many practical applications have been reported in the literature. However, there has been only limited discussion about how workload equity should be modeled in VRPs, and various measures for optimizing such objectives have been proposed and implemented without a critical evaluation of their respective merits and consequences. This article addresses this gap with an analysis of classical and alternative equity functions for biobjective VRP models. In our survey, we review and categorize the existing literature on equitable VRPs. In the analysis, we identify a set of axiomatic properties that an ideal equity measure should satisfy, collect six common measures, and point out important connections between their properties and those of the resulting Pareto-optimal solutions. To gauge the extent of these implications, we also conduct a numerical study on small biobjective VRP instances solvable to optimality. Our study reveals two undesirable consequences when optimizing equity with nonmonotonic functions: Pareto-optimal solutions can consist of non-TSP-optimal tours, and even if all tours are TSP optimal, Pareto-optimal solutions can be workload inconsistent, i.e. composed of tours whose workloads are all equal to or longer than those of other Pareto-optimal solutions. We show that the extent of these phenomena should not be underestimated. The results of our biobjective analysis are valid also for weighted sum, constraint-based, or single-objective models. Based on this analysis, we conclude that monotonic equity functions are more appropriate for certain types of VRP models, and suggest promising avenues for further research.Comment: Accepted Manuscrip

A new formulation approach for location routing problems

Cataloged from PDF version of article.A Location-Routing Problem (LRP) combines two difficult problems, facility location and vehicle routing, and as such it is inherently hard to solve. In this paper, we propose a different formulation approach than the common arc-based product-flow (Arc-BPF) approach in the literature. We associate product amounts to the nodes of the network resulting in a node-based product-flow (Node-BPF) formulation. Our main objective is to develop LRP models with fewer constraints and variables, which can be solved more efficiently. To introduce the proposed approach, we reformulate a complex four-index Arc-BPF LRP model from the literature as a three-index Node-BPF model, which computationally outperforms the former. We then introduce a heuristic method

A new management scheme to support reverse logistics processes in the agrifood distribution sector

During the last decades, reverse logistics and reuse of products have received growing attention as profitable and sustainable business strategies. Looking at the agrifood distribution sector, every day thousands of agrifood stores throw away large quantities of food product no longer suitable for sale. This "waste product", in the majority of cases, could still find new uses as animal feed or fertilizer. The return flow of food product is a typical problem of reverse logistics. This study proposes a new bi-modular scheme for managing the process of collection of "food waste" resulting from the agribusiness distribution sector and its subsequent distribution to livestock farms and collection centers located in the area of interest. The proposed management scheme consists of two modules: - module 1: to cluster the observed area into convenient collection sectors by means of clustering algorithms; - module 2: to identify optimal retrieval routes within each cluster by using Vehicle Routing models. The province of Cagliari in Sardinia (Italy) has been identified as test area. An extensive data collection process has been performed in order to collect the information necessary to portray the existing scenario. The following businesses have been recorded: grocery stores and supermarkets with at least 400 sqm of retail area, livestock farms with at least 200 heads of cattle, feed mills. A number of variables concerning location, type, size and demand data have been collected for each recorded unit.The management scheme has been implemented in a software platform and successfully applied in the test area. The outcome provides useful insights to stakeholders and suggests avenues for further research in the area in order to develop a more general and intuitive tool for managing reverse logistics processes in agrifood chains

Designing sustainable cold chains for long-range food distribution: Energy-effective corridors on the Silk Road Belt

Modern food production-distribution processes represent a critical stressor for the environment and for natural ecosystems. The rising flows of food across growing and consumption areas couple with the higher expectations of consumers for the quality of products and compel the intensive use of refrigerated rooms and transport means throughout the food supply chain. In order to aid the design of sustainable cold chains that incorporate such aspects, this paper proposes a mixed integer linear programming model to minimize the total energy consumption associated with the cold operations experienced by perishable products. This model is intended for food traders, logistics practitioners, retail managers, and importers collaboratively called to design and plan a cost and environmentally effective supply strategy, physical channels, and infrastructures for cold chains. The proposed model is validated with a case study inspired by the distribution of two example food products, namely fresh apples and ice cream, along the New Silk Road connecting Europe and China. The illustrated analysis investigates the effect of alternative routes and transport modes on the sustainability of the cold chain. It is found that the most energy-efficient route for ice cream is via rail over a northern route and, for apples, is via a southern maritime route, and, for these two routes, the ratios of the total energy consumed to the energy content of the food are 760 and 913, respectively. By incorporating the energy lost due to the food quality decay, the model identifies the optimal route to adopt in accordance with the shelf life and the conservation temperature of each product

The Bi-objective Periodic Closed Loop Network Design Problem

© 2019 Elsevier Ltd. This manuscript is made available under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International licence (CC BY-NC-ND 4.0). For further details please see: https://creativecommons.org/licenses/by-nc-nd/4.0/Reverse supply chains are becoming a crucial part of retail supply chains given the recent reforms in the consumers’ rights and the regulations by governments. This has motivated companies around the world to adopt zero-landfill goals and move towards circular economy to retain the product’s value during its whole life cycle. However, designing an efficient closed loop supply chain is a challenging undertaking as it presents a set of unique challenges, mainly owing to the need to handle pickups and deliveries at the same time and the necessity to meet the customer requirements within a certain time limit. In this paper, we model this problem as a bi-objective periodic location routing problem with simultaneous pickup and delivery as well as time windows and examine the performance of two procedures, namely NSGA-II and NRGA, to solve it. The goal is to find the best locations for a set of depots, allocation of customers to these depots, allocation of customers to service days and the optimal routes to be taken by a set of homogeneous vehicles to minimise the total cost and to minimise the overall violation from the customers’ defined time limits. Our results show that while there is not a significant difference between the two algorithms in terms of diversity and number of solutions generated, NSGA-II outperforms NRGA when it comes to spacing and runtime.Peer reviewedFinal Accepted Versio

Dynamic routing and service network design for less-than-truckload (LTL) motor carriers

This research tries to address the dynamic priority shipment routing problem and dynamic service network design problem for the less-than-truckload (LTL) carriers. First, described is a decision support tool to assist LTL managers in studying, analyzing and planning LTL operations so that scarce resources are used more effectively and efficiently. The decision support tool helps to understand the complicated interactions between the shipment route, closing rules, cost, and service level. Numerical experiments are done using the decision support tool to analyze the existing rules of LTL carriers and to understand their effect on the total cost of the system and the service level provided;Currently, LTL carriers route both regular and priority shipments through their service networks using some fixed route patterns known as load plans. In this research, an alternative routing strategy for routing priority shipments in LTL networks is proposed. This strategy exploits the stochasticity and dynamism embedded in the routing process and utilizes the real time information about terminals to determine the shipment routes adaptively. The research shows that this strategy can be formulated as the problem of finding a dynamic shortest path problem over a network with random arc costs. An efficient algorithm is developed that can solve this optimization problem in real-time. Numerical testing using real data sets suggests that the proposed strategy can improve the level of service for priority shipments;LTL carriers currently use ad hoc rules in deciding when there is enough capacity to close a trailer. In order to reduce the fixed and penalty costs incurred by the LTL carriers and to increase the service level provided by LTL carriers to customers, the decision should be optimized over time. In other words, the decision to dispatch a trailer should not only depend on the current shipment level, but should also vary dynamically based on time of day, day of the week, and seasonal effects. A dynamic control policy for dispatching a trailer over a single link is proposed in this research. This research provides an approach to estimate the shape of the recourse function. The dynamic control policy exploits the linearity of the recourse function estimated in solving the trailer dispatching problem efficiently. The algorithm is easy to implement and computationally fast and hence can be extended to solve large LTL networks. Experiments with the dynamic control policy show that the solutions obtained are very close to the optimal

Operational research IO 2021—analytics for a better world. XXI Congress of APDIO, Figueira da Foz, Portugal, November 7–8, 2021

This book provides the current status of research on the application of OR methods to solve emerging and relevant operations management problems. Each chapter is a selected contribution of the IO2021 - XXI Congress of APDIO, the Portuguese Association of Operational Research, held in Figueira da Foz from 7 to 8 November 2021. Under the theme of analytics for a better world, the book presents interesting results and applications of OR cutting-edge methods and techniques to various real-world problems. Of particular importance are works applying nonlinear, multi-objective optimization, hybrid heuristics, multicriteria decision analysis, data envelopment analysis, simulation, clustering techniques and decision support systems, in different areas such as supply chain management, production planning and scheduling, logistics, energy, telecommunications, finance and health. All chapters were carefully reviewed by the members of the scientific program committee.info:eu-repo/semantics/publishedVersio