540 research outputs found
A Study on the Vehicle Routing Problem Considering Infeasible Routing Based on the Improved Genetic Algorithm
The study aims to optimize the vehicle routing problem, considering infeasible routing, to minimize losses for the company. Firstly, a vehicle routing model with hard time windows and infeasible route constraints is established, considering both the minimization of total vehicle travel distance and the maximization of customer satisfaction. Subsequently, a Floyd-based improved genetic algorithm that incorporates local search is designed. Finally, the computational experiment demonstrates that compared with the classic genetic algorithm, the improved genetic algorithm reduced the average travel distance by 20.6% when focusing on travel distance and 18.4% when prioritizing customer satisfaction. In both scenarios, there was also a reduction of one in the average number of vehicles used. The proposed method effectively addresses the model introduced in this study, resulting in a reduction in total distance and an enhancement of customer satisfaction
Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem
AbstractDial-a-ride problems deal with the transportation of people between pickup and delivery locations. Given the fact that people are subject to transportation, constraints related to quality of service are usually present, such as time windows and maximum user ride time limits. In many real world applications, different types of users exist. In the field of patient and disabled people transportation, up to four different transportation modes can be distinguished. In this article we consider staff seats, patient seats, stretchers and wheelchair places. Furthermore, most companies involved in the transportation of the disabled or ill dispose of different types of vehicles. We introduce both aspects into state-of-the-art formulations and branch-and-cut algorithms for the standard dial-a-ride problem. Also a recent metaheuristic method is adapted to this new problem. In addition, a further service quality related issue is analyzed: vehicle waiting time with passengers aboard. Instances with up to 40 requests are solved to optimality. High quality solutions are obtained with the heuristic method
Optimization of transportation requirements in the deployment of military units
Cataloged from PDF version of article.We study the deployment planning problem (DPP) that may roughly be defined as the problem of the planning of
the physical movement of military units, stationed at geographically dispersed locations, from their home bases to
their designated destinations while obeying constraints on scheduling and routing issues as well as on the availability
and use of various types of transportation assets that operate on a multimodal transportation network. The DPP is a
large-scale real-world problem for which analytical models do not exist.We propose a model for solving the problem
and develop a solution methodology which involves an effective use of relaxation and restriction that significantly
speeds up a CPLEX-based branch-and-bound. The solution times for intermediate-sized problems are around 1 h
at maximum, whereas it takes about a week in the Turkish Armed Forces to produce a suboptimal feasible solution
based on trial-and-error methods. The proposed model can be used to evaluate and assess investment decisions
in transportation infrastructure and transportation assets as well as to plan and execute cost-effective deployment
operations at different levels of planning.
2005 Elsevier Ltd. All rights reserved
Order picking problems under weight, fragility, and category constraints
Warehouse order picking activities are among the ones that impact the most the bottom lines of warehouses.
They are known to often account for more than half of the total warehousing costs. New practices
and innovations generate new challenges for managers and open new research avenues. Many practical
constraints arising in real-life have often been neglected in the scientific literature. We introduce, model,
and solve a rich order picking problem under weight, fragility, and category constraints, motivated by
our observation of a real-life application arising in the grocery retail industry. This difficult warehousing
problem combines complex picking and routing decisions under the objective of minimizing the distance
traveled. We first provide a full description of the warehouse design which enables us to algebraically
compute the distances between all pairs of products. We then propose two distinct mathematical models
to formulate the problem. We develop five heuristic methods, including extensions of the classical largest
gap, mid point, S-shape, and combined heuristics. The fifth one is an implementation of the powerful
adaptive large neighborhood search algorithm specifically designed for the problem at hand. We then implement
a branch-and-cut algorithm and cutting planes to solve the two formulations. The performance
of the proposed solution methods is assessed on a newly generated and realistic test bed containing up
to 100 pickups and seven aisles. We compare the bounds provided by the two formulations. Our in-depth
analysis shows which formulation tends to perform better. Extensive computational experiments confirm
the efficiency of the ALNS matheuristic and derive some important insights for managing order picking
in this kind of warehouses
A Study on the Vehicle Routing Problem Considering Infeasible Routing Based on the Improved Genetic Algorithm
The study aims to optimize the vehicle routing problem, considering infeasible routing, to minimize losses for the company. Firstly, a vehicle routing model with hard time windows and infeasible route constraints is established, considering both the minimization of total vehicle travel distance and the maximization of customer satisfaction. Subsequently, a Floyd-based improved genetic algorithm that incorporates local search is designed. Finally, the computational experiment demonstrates that compared with the classic genetic algorithm, the improved genetic algorithm reduced the average travel distance by 20.6% when focusing on travel distance and 18.4% when prioritizing customer satisfaction. In both scenarios, there was also a reduction of one in the average number of vehicles used. The proposed method effectively addresses the model introduced in this study, resulting in a reduction in total distance and an enhancement of customer satisfaction
- …