A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Bees Algorithm for Vehicle Routing Problems with Time Windows
2018
International Journal of Machine Learning and Computing
Preserved Fulltext
Index Terms-Foraging behaviour, bees algorithm, vehicle routing problem with time windows. ...
This paper presents the bees algorithm for vehicle routing problems within time windows (VRPTW). ...
THE VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS This study focuses on the VRPTW in order to understand its complexity and maximize its advantages in real life. ...
doi:10.18178/ijmlc.2018.8.3.693
fatcat:7577235xgffyvi6t33hvujzmfy
Scatter Search for Vehicle Routing Problem with Time Windows and Split Deliveries
[chapter]
2008
Vehicle Routing Problem
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The vehicle routing problem with time windows and split deliveries (VRPTWSD) is an extension of the VRPSD, adding to it the time window restraints. ...
This work develops a scatter search (SS) algorithm to solve a vehicle routing problem with time windows and split deliveries (VRPTWSD). ...
Conclusions and future research We have proposed a scatter search algorithm for the Vehicle Routing Problem with Time Windows and Split Deliveries. ...
doi:10.5772/5613
fatcat:7i4oiq7rnzgcphqjv7222eo72m
A green perspective on capacitated time-dependent vehicle routing problem with time windows
2017
International Journal of Supply Chain and Inventory Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
This study presents a novel approach to the vehicle routing problem by focusing on greenhouse gas emissions and fuel consumption aiming to mitigate adverse environmental effects of transportation. ...
A time-dependent model with time windows is developed to incorporate speed and schedule in transportation. ...
They focused on hard and soft time windows, impacts of traffic information, and congestion avoidance in time-dependent VRP with time windows. ...
doi:10.1504/ijscim.2017.086372
fatcat:3svw25agq5exrnatwu3tvr2sfy
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
2005
Transportation Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
T his paper surveys the research on the metaheuristics for the Vehicle Routing Problem with Time Windows (VRPTW). ...
The routes must be designed in such a way that each point is visited only once by exactly one vehicle within a given time interval; all routes start and end at the depot, and the total demands of all points ...
The motivation and background for researching the vehicle routing problem with time windows (VRPTW) as well as the problem description are discussed in the first part of this article (Bräysy and Gendreau ...
doi:10.1287/trsc.1030.0057
fatcat:76maqrz7q5cgpgk5dlb6zuxl44
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
[chapter]
2010
Parallel Problem Solving from Nature, PPSN XI
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous fleet of vehicles with limited ...
In this paper, we propose and analyze the performance of an improved multi-objective evolutionary algorithm, that simultaneously minimizes the number of routes, the total travel distance, and the delivery ...
The variant with Time Windows (VRPTW) is particularly relevant to practical applications, and considers vehicles with limited capacity and specific delivery time windows. ...
doi:10.1007/978-3-642-15871-1_6
dblp:conf/ppsn/Garcia-NajeraB10
fatcat:5fbsjwe53vfsvdamjj2hqmw7nm
A Computational Study of Genetic Crossover Operators for Multi-Objective Vehicle Routing Problem with Soft Time Windows
[article]
2008
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
The article describes an investigation of the effectiveness of genetic algorithms for multi-objective combinatorial optimization (MOCO) by presenting an application for the vehicle routing problem with ...
Computational results are presented for different classes of vehicle routing problems, varying in their coverage with time windows, time window size, distribution and number of customers. ...
Genetic algorithms, tabu search and simulated annealing methods for vehicle routing problems with time windows. ...
arXiv:0809.0410v1
fatcat:je3btcb2g5devcf6e6oamxcqxi
Integrating Fuzzy and Ant Colony System for Fuzzy Vehicle Routing Problem with Time Windows
2020
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper fuzzy VRPTW with an uncertain travel time is considered. ...
We propose the integration of fuzzy and ant colony system based evolutionary algorithm to solve the problem while preserving the constraints. ...
Till now many variants of the problem have been proposed [2] . Vehicle Routing Problem with Time Windows is one flavor of VRP. ...
doi:10.5281/zenodo.3984663
fatcat:v5ypkhiekjds7lvy2bssxuqtxy
Multi-Objective Vehicle Routing Problem with Time Windows and Fuel Consumption Minimizing
2016
Proceedings of 5th the International Conference on Operations Research and Enterprise Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A new solution based on the evolutionary algorithm is proposed and its performance is compared with the CPLEX Solver. Results illustrate the efficiency and effectiveness of proposed approach. ...
Transportation often represents the most important single element in logistics costs and its reduction and finding the best routes that a vehicle should follow through a network is an important decision ...
Multi-Objective Vehicle Routing Problem with Time Windows and Fuel Consumption Minimizing ...
doi:10.5220/0005657900920099
dblp:conf/icores/GhannadpourH16
fatcat:jrwutryyjjfdpi247kmb2rj2tm
Vehicle Routing Problem with Time Windows for Reducing Fuel Consumption
2012
Journal of Computers
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Most of the studies on vehicle routing problem with time windows (VRPTW) aim to minimize total travel distance or travel time. ...
Then, a novel tabu search algorithm with a random variable neighborhood descent procedure (RVND) is given, which uses an adaptive parallel route construction heuristic, introduces six neighborhood search ...
Yu and Yang [10] developed an improved ant colony optimization (IACO) to solve period vehicle routing problem with time windows, in which the planning period is extended to several days and each client ...
doi:10.4304/jcp.7.12.3020-3027
fatcat:iezmuqymffctbc5c5nacrgxk2e
The capacitated vehicle routing problem with soft time windows and stochastic travel times
2019
Revista Facultad de Ingeniería
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A full multiobjective approach is employed in this paper to deal with a stochastic multiobjective capacitated vehicle routing problem (CVRP). ...
A soft time window is tied to every customer and there is a penalty for starting the service outside the time window. Two objectives are minimized, the total length and the time window penalty. ...
This paper deals with a stochastic multiobjective vehicle routing problem with soft time windows (TW). ...
doi:10.19053/01211129.v28.n50.2019.8782
fatcat:3evcbew4rvak3bqculoj6uqhqy
Evolutionary algorithm for the bi-objective green vehicle routing problem with time windows
2021
Malaya Journal of Matematik
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper, the bi-objective vehicle routing problem with time windows [BO-VRPTW] is proposed based on the existing research and a bi-objective mathematical model is formulated. ...
The main objective of this paper is to find the lowest -cost set of routes to deliver demand using identical vehicles with limited capacity to customers with fixed service time windows. ...
Q =max {d i : i∈{1. . . ..n}}
Evolutionary algorithm for the bi-objective green vehicle routing problem with time windows -74/78 ...
doi:10.26637/mjm0901/0011
fatcat:bbvpqxqtbrgtdnfvqaeq2echmy
A P-Based Hybrid Evolutionary Algorithm for Vehicle Routing Problem with Time Windows
2014
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This work combines membrane systems and genetic operators to build an approximated algorithm for the vehicle routing problem with time windows. ...
The ability to solve optimization problems using membrane algorithms is an important application of membrane computing. ...
Other types of VRPTW, such as multi-depot vehicle routing problem with time windows [46, 47] , vehicle routing problem with soft time windows [48, 49] , and vehicle routing problem with split deliveries ...
doi:10.1155/2014/169481
fatcat:hssjh5qntjacrompcw4rsimy2u
An Improved Evolutionary Algorithm for Dynamic Vehicle Routing Problem with Time Windows
[chapter]
2007
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
, and an improved evolutionary algorithm for searching the best vehicle routes in dynamic network. ...
The interest in this problem is motivated by its practical relevance as well as by its considerable difficulty. We present an approach to search for best routes in dynamic network. ...
The problem considered in this paper is the Dynamic Vehicle Routing Problem with Time Window (DVRPTW). We present an approach to search for best routes in dynamic network. ...
doi:10.1007/978-3-540-72590-9_171
fatcat:454wos7q3jabnllsnnv7kmj734
A hybrid genetic algorithm for the vehicle routing problem with time windows
[chapter]
1998
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. ...
However, very few genetic-based approaches exploit implicit knowledge provided by the structure of the intermediate solutions computed during the evolutionary process to explore the solution space. ...
Introduction In the vehicle routing problem with time windows [1, 2] , a set of customers with specific demands is serviced by a homogeneous fleet of vehicles of limited capacity, initially located at ...
doi:10.1007/3-540-64575-6_44
fatcat:mzyckawedbc2tjzx5xyueijjzy
A memetic algorithm for the vehicle routing problem with time windows
2008
Reserche operationelle
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This article deals with the vehicle routing problem with time windows (VRPTW). This problem consists in determining a leastcost set of trips to serve customers during specific time windows. ...
Cet article concerne le problème de tournées de véhicules avec fenêtres horaires (Vehicle Routing Problem with Time Windows ou VRPTW). ...
MA1 finds better results on problems with large time windows (classes R2 and RC2), with a saving exceeding 4% for two problems. ...
doi:10.1051/ro:2008021
fatcat:loxzijpv2vfqroo36qvmmmnste
« Previous
Showing results 1 — 15 out of 5,216 results