Vehicle routing problems with time windows using simulated annealing

SW Lin, KC Ying, ZJ Lee… - 2006 IEEE International …, 2006 - ieeexplore.ieee.org
Supply chain management is paid attention to every large enterprise. Enterprise reduces
their transporting and distributing cost through the manner of subcontractors and shared …

[PDF][PDF] Finding near optimal solutions for vehicle routing problems with time windows using hybrid genetic algorithm

GB Alvarenga, GR Mateus… - Proc. Int. Workshop Freight …, 2003 - researchgate.net
Abstract The Vehicle Routing Problem with Time Windows (VRPTW) is a well-know and
complex combinatorial problem, which has received considerable attention in recent years …

A Hybrid Algorithm for the Vehicle Routing Problem with Window

GB Alvarenga, RM de Abreu Silva… - INFOCOMP Journal of …, 2005 - infocomp.dcc.ufla.br
Abstract The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and
complex combinatorial problem, which has received considerable attention in recent years …

[PDF][PDF] Hybrid genetic algorithm, simulated annealing and tabu search methods for vehicle routing problems with time windows

SR Thangiah, IH Osman, T Sun - … , Technical Report SRU CpSc-TR-94-27, 1994 - Citeseer
ABSTRACT The Vehicle Routing Problem with Time Windows (VRPTW) involves servicing a
set of customers, with earliest and latest time deadlines, with varying demands using …

[PDF][PDF] Issues in solving vehicle routing problem with time window and its variants using meta heuristics-a survey

VK Sandhya - International Journal of Engineering and Technology, 2013 - Citeseer
ABSTRACT Vehicle Routing Problem with Time Window (VRPTW) is an extension of
classical Vehicle Routing Problem (VRP). It is NP hard, combinatorial optimization problem …

Solving practical vehicle routing problem with time windows using metaheuristic algorithms

F Taner, A Galić, T Carić - PROMET-traffic&Transportation, 2012 - traffic.fpz.hr
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and
shows that implementing algorithms for solving various instances of VRPs can significantly …

A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing

R Tavakkoli-Moghaddam, M Gazanfari… - Journal of manufacturing …, 2011 - Elsevier
This paper presents an extension of a competitive vehicle routing problem with time
windows (VRPTW) to find short routes with the minimum travel cost and maximum sale by …

Solving vehicle routing problem with time windows using metaheuristic approaches

Z Aydınalp, D Özgen - International Journal of Intelligent Computing …, 2023 - emerald.com
Purpose Drugs are strategic products with essential functions in human health. An optimum
design of the pharmaceutical supply chain is critical to avoid economic damage and adverse …

A hybrid algorithm for vehicle routing problem with time windows

B Yu, ZZ Yang, BZ Yao - expert systems with applications, 2011 - Elsevier
Vehicle routing problem with time windows (VRPTW) is a well-known combinatorial
problem. Many researches have presented meta-heuristics are effective approaches for …

A hybrid search alogrithm for the vehicle routing problem with time windows

WK Ho, JC Ang, A Lim - International journal on artificial intelligence …, 2001 - World Scientific
The vehicle routing problem with time windows (VRPTW) is an extension of the well-known
vehicle routing problem (VRP). It involves a fleet of homogeneous vehicles, originating and …