572 research outputs found
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
Optimisation of Capacitated Planned Preventive Maintenance in Multiple Production Lines Using Optimisation-in-the-Loop Simulation
In a mass customisation manufacturing system, the production schedule is tailored to the customer's specifications. However, the production system must be accompanied by an effective maintenance program to ensure that the production lines operate as intended. The purpose of this study is to optimise planned preventive maintenance across multiple production lines. An optimised Weibull distribution is proposed to model the machine's Mean Time Between Failures (MTBF), and the total expected maintenance cost is calculated using this distribution, taking into account the probability of the machines remaining operational and failing. Because the optimised Weibull distribution is a continuous distribution, in order to simulate the continuous time domain, it will be divided into several sub-systems and optimised using Bayesian optimisation during simulation. The maintenance scheduling is carried out by considering available time capacity after production scheduling was arranged. The study's findings indicate that the proposed method successfully optimised the planned maintenance schedule without interfering production activity with total cost for the proposed maintenance planning as low as IDR 50.017,75/maintenance unit time
Optimisation of Capacitated Planned Preventive Maintenance in Multiple Production Lines Using Optimisation-in-the-Loop Simulation
In a mass customisation manufacturing system, the production schedule is tailored to the customer's specifications. However, the production system must be accompanied by an effective maintenance program to ensure that the production lines operate as intended. The purpose of this study is to optimise planned preventive maintenance across multiple production lines. An optimised Weibull distribution is proposed to model the machine's Mean Time Between Failures (MTBF), and the total expected maintenance cost is calculated using this distribution, taking into account the probability of the machines remaining operational and failing. Because the optimised Weibull distribution is a continuous distribution, in order to simulate the continuous time domain, it will be divided into several sub-systems and optimised using Bayesian optimisation during simulation. The maintenance scheduling is carried out by considering available time capacity after production scheduling was arranged. The study's findings indicate that the proposed method successfully optimised the planned maintenance schedule without interfering production activity with total cost for the proposed maintenance planning as low as IDR 50.017,75/maintenance unit time
Arc routing problems: A review of the past, present, and future
[EN] Arc routing problems (ARPs) are defined and introduced. Following a brief history of developments in this area of research, different types of ARPs are described that are currently relevant for study. In addition, particular features of ARPs that are important from a theoretical or practical point of view are discussed. A section on applications describes some of the changes that have occurred from early applications of ARP models to the present day and points the way to emerging topics for study. A final section provides information on libraries and instance repositories for ARPs. The review concludes with some perspectives on future research developments and opportunities for emerging applicationsThis research was supported by the Ministerio de Economia y Competitividad and Fondo Europeo de Desarrollo Regional, Grant/Award Number: PGC2018-099428-B-I00. The Research Council of Norway, Grant/Award Numbers: 246825/O70 (DynamITe), 263031/O70 (AXIOM).Corberán, Á.; Eglese, R.; Hasle, G.; Plana, I.; Sanchís Llopis, JM. (2021). Arc routing problems: A review of the past, present, and future. Networks. 77(1):88-115. https://doi.org/10.1002/net.21965S8811577
Mathematical models for planning support
In this paper we describe how computer systems can provide planners with active planning support, when these planners are carrying out their daily planning activities. This means that computer systems actively participate in the planning process by automatically generating plans or partial plans. Active planning support by computer systems requires the application of mathematical models and solution techniques. In this paper we describe the modeling process in general terms, as well as several modeling and solution techniques. We also present some background information on computational complexity theory, since most practical planning problems are hard to solve. We also describe how several objective functions can be handled, since it is rare that solutions can be evaluated by just one single objective. Furthermore, we give an introduction into the use of mathematical modeling systems, which are useful tools in a modeling context, especially during the development phases of a mathematical model. We finish the paper with a real life example related to the planning process of the rolling stock circulation of a railway operator.optimization;mathematical models;modeling process;planning support;Planning
The stochastic vehicle routing problem : a literature review, part I : models
Building on the work of Gendreau et al. (Eur J Oper Res 88(1):3–12; 1996), we review the past 20 years of scientific literature on stochastic vehicle routing problems. The numerous variants of the problem that have been studied in the literature are described and categorized. Keywords: vehicle routing (VRP), stochastic programming, SVRPpublishedVersio
Improvement to an existing multi-level capacitated lot sizing problem considering setup carryover, backlogging, and emission control
This paper presents a multi-level, multi-item, multi-period capacitated lot-sizing problem. The lot-sizing problem studies can obtain production quantities, setup decisions and inventory levels in each period fulfilling the demand requirements with limited capacity resources, considering the Bill of Material (BOM) structure while simultaneously minimizing the production, inventory, and machine setup costs. The paper proposes an exact solution to Chowdhury et al. (2018)\u27s[1] developed model, which considers the backlogging cost, setup carryover & greenhouse gas emission control to its model complexity. The problem contemplates the Dantzig-Wolfe (D.W.) decomposition to decompose the multi-level capacitated problem into a single-item uncapacitated lot-sizing sub-problem. To avoid the infeasibilities of the weighted problem (WP), an artificial variable is introduced, and the Big-M method is employed in the D.W. decomposition to produce an always feasible master problem. In addition, Wagner & Whitin\u27s[2] forward recursion algorithm is also incorporated in the solution approach for both end and component items to provide the minimum cost production plan. Introducing artificial variables in the D.W. decomposition method is a novel approach to solving the MLCLSP model. A better performance was achieved regarding reduced computational time (reduced by 50%) and optimality gap (reduced by 97.3%) in comparison to Chowdhury et al. (2018)\u27s[1] developed model
Applying Operations Research techniques to planning of train shunting
In this paper, we discuss a model-based algorithmic approach for supporting planners in the creation of shunt plans for passenger trains. The approach provides an example of a mathematical model and a corresponding solution approach for model based support. We introduce a four-step solution approach and we discuss how the planners are supported by this approach. Finally, we present computational results for these steps and give some suggestions for further research.A* search;railway optimization;real world application;routing
A Vehicle Routing Problem with Multiple Service Agreements
We consider a logistics service provider which arranges transportation services to customers with different service agreements. The most prominent feature of this service agreement is the time period in which these customers send their orders and want to retrieve delivery information. After customers place their orders, they require information about the driver and an early indication of the arrival times. At the moment, this information needs to be provided. The order information of other customers with a different service agreement that needs to be serviced in the same period might still be unknown. Ultimately all customers have to be planned, constrained by the information provided to the customers in the earlier stage. In this paper, we investigate how the logistic service provider plans its routes and communicates the driver and arrival time information in the phase where not all customers are known (stage 1). Once all customer orders are known (stage 2), the final routes can be determined, which adhere to the already communicated driver and arrival time information from stage 1, minimizing total routing cost. For this problem, an exact algorithm is presented. This problem is solved using a novel tractable branch-and-bound method and re-optimization in stage 2. Detailed results are presented, showing the improvements of using re-optimization. We show that integrating the planning of the customers with the different service agreements leads to significant cost savings compared to treating the customers separately (as is currently done by most logistics service providers).</p
- …