Results 61 to 70 of about 11,225 (197)
Reoptimization Heuristic for the Capacitated Vehicle Routing Problem
Journal of Advanced Transportation, 2018 The solution to a dynamic context of the Capacitated Vehicle Routing Problem (CVRP) is challenging. Routing and replenishment decisions are necessary by considering the assignment of customers to vehicles when the information is gradually revealed over ...
Rodrigo Linfati, John Willmer Escobar
doaj +1 more source
The Shrinking and Expanding Heuristic for the Fleet Size and Mix Vehicle Routing Problem
Communications, 2013 The FSMVRP (Fleet Size and Mix Vehicle Routing Problem) is a variant of the classical Capacitated Vehicle Routing Problem, CVRP. We suggest a new methodology, called the Shrinking and Expanding Heuristic (SEH) which is incorporated in a standard tabu ...
Urooj Pasha +2 more
doaj +1 more source
A dynamic approach for the vehicle routing problem with stochastic demands [PDF]
, 2011 The Vehicle Routing Problem with Stochastic Demands (VRPSD) is a variation of the classical Capacitated Vehicle Routing Problem (CVRP). In contrast to the deterministic CVRP, in the VRPSD the demand of each customer is modeled as a random variable and ...
Guéret, Christelle +2 more
core +2 more sources
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
International Journal of Industrial Engineering and Production Research, 2016 Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered.
Yahia Zare Mehrjerdi, Ali Nadizadeh
doaj
Journal of Applied Mathematics, 2013 This paper presents a flexible solution methodology for the capacitated vehicle routing problem with stochastic travel times (CVRPSTT). One of the basic ideas of the methodology is to consider a vehicle working time lower than the actual maximum vehicle ...
Zheng Wang, Lin Lin
doaj +1 more source
IEEE Access, 2020 In this paper, a multi depots capacitated electric vehicle routing problem where client demand is composed of two-dimensional weighted items (2L-MDEVRP) is addressed. This problem calls for the minimization of the transportation distance required for the
Xiaoning Zhu +5 more
doaj +1 more source
, 2020 Multitasking optimization is a recently introduced paradigm, focused on the simultaneous solving of multiple optimization problem instances (tasks). The goal of multitasking environments is to dynamically exploit existing complementarities and synergies ...
Del Ser, Javier +4 more
core +1 more source
Application of the Branch and Cut Method to the Vehicle Routing Problem [PDF]
, 2000 The successful application of Branch and Cut methods to the TSP has drawn attention also to the polyhedral properties of the symmetric capacitated vehicle routing problem, which is the capacitated counterpart of the TSP.
Blasum, Ulrich, Hochstättler, Winfried
core +1 more source
Comparison of Randomized Solutions for Constrained Vehicle Routing Problem
, 2020 In this short paper, we study the capacity-constrained vehicle routing problem (CVRP) and its solution by randomized Monte Carlo methods. For solving CVRP we use some pseudorandom number generators commonly used in practice.
Demirci, İbrahim Ethem +2 more
core +1 more source
Jurnal Sistem dan Manajemen Industri, 2019 In recent years, minimization of logistics and transportation costs has become essential for manufacturing companies to increase profits. One thing is done to reduce logistics and transportation costs by optimizing the route of taking or transporting ...
Iwan Aang Soenandi +2 more
doaj +1 more source