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
Vehicle Routing Problem
In addition, the authors are grateful to the generous supports from the Department of Electrical and Electronic Engineering, the University of Hong Kong to this work. ... Acknowledgements The authors wish to thank Professor Edward Tsang and Professor Yi Shang for their fruitful discussions. ... s work  An Effective Search Framework Combining Meta-Heuristics to Solve the Vehicle Routing Problems with Time Windows 37 Table 1 . 1 A Comparison of the Performance of All the Solvers initialised ...doi:10.5772/5638 fatcat:bpusv666lbfovp3nfulymlx424
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. ... There were many interesting heuristics proposed to handle these problems effectively. ... ACKNOWLEDGEMENTS The authors wish to thank Professor Edward Tsang for his fruitful discussion. ...doi:10.1023/b:aire.0000020864.28300.ed fatcat:3ltk4cbbyjafxg2q7ffjhdm5l4
In this paper, we have conducted a literature review on the recent developments and publications involving the vehicle routing problem and its variants, namely vehicle routing problem with time windows ... In this paper we discuss the various exact methods and the heuristics and meta-heuristics used to solve the VRP and its variants. ... In their paper,  present a meta-heuristic, which is based on the Threshold Accepting combined with modified Nearest Neighbour and Exchange procedures, to solve the Vehicle Routing Problem with Backhauls ...doi:10.4236/iim.2012.43010 fatcat:bhzk37ixjnevhfj3shywxc2ccq
The Journal of the Operational Research Society
time Form a final solution by combining the best of the assignment routes, in terms of travelling and vehicle waiting times, with the routes provided by heuristic or meta-heuristic methods applied to ... the shortest path problem with time windows,'* vehicle routing,'* and material handling systems design. ...
The Journal of the Operational Research Society
From the literature survey papers, we conclude that the approaches developed for the vehicle routing problem with time windows can be classified as follows: (a) improvement and construction heuristics: ... of the well known vehicle routing problem with time windows (VRPTW).° The depot of this VRPTW is the shipping area of the facility (or warehouse), including the docks for truck loading. ...
In this paper, an attempt has been made to develop a GA based meta-heuristic to solve the time dependent vehicle route problem with time windows (TDVRPTW). ... To get solutions in determining routes which are realistic and very close to the optimal solution, one has to use heuristics and meta-heuristics. ... Acknowledgements The authors wish to express their deepest gratitude to the researchers Mr. Andreas Scheibenpflug and Mr. Philipp Fleck of FH Hagenberg, Austria, for their help. ...doi:10.4236/jssm.2015.86085 fatcat:v5zcc2mdpncixaqxnmj5mzgkz4
This paper presents a meta-heuristic, which is based on the Threshold Accepting combined with modified Nearest Neighbor and Exchange procedures, to solve the Vehicle Routing Problem with Backhauls and ... Time Windows (VRPBTW). ... ACKNOWLEDGEMENTS The authors gratefully acknowledge the support of the National Science Council of the R.O.C. in Taiwan under grant number NSC93-2211-E-216-009. ...doi:10.11175/easts.6.3022 fatcat:3fjnga3tmngefbyps6l4oomesa
Making, Compromise Programming, Surrogate Worth Trade-off Method) and various versions of vehicle routing problem (VRP), Multi depot VRP (MDVRP), VRP with time windows (VRPWTW), Stochastic VRP (SVRP), ... the problem. ... Vehicle Routing Problems with Time Windows Vehicle routing problem with time windows are divided into two categories of VRP with hard time windows (VRPHTW) and VRP with soft time windows (VRPSTW). ...doaj:9e4c7d0f2e8f492bade82b93cbd4ebac fatcat:5oj3hokrffcl3b7unsnbg6njgi
International Journal of Advanced Research in Computer Science and Software Engineering
The capacitated vehicle routing problem with time windows (CVRPTW), broadly utilize in practice, comes under category of NP-hard problem. ... The effectiveness of ACO-GA is evaluated by comparing it with other meta-heuristics such as GA and ACO. ... CVRPTW Capacitated Vehicle Routing Problem with Time Windows is a generality of CVRP. In CVRPTW capacity constraints and time windows constraints are introduced. ...doi:10.23956/ijarcsse/v7i6/0319 fatcat:43izwltydvfxvgalxkpjiacnhy
Given that solving the problem is time-consuming, the MOPSO meta-heuristic algorithm was used in order to solve the problem. ... The present study aimed at routing vehicles from a depot in two-level supply chain with a meta-heuristic algorithm. This study is an analytical type of research. ... Therefore, addressing this issue is very important for correctly solving the problem of vehicles transportation with time window. ...doi:10.12913/22998624/105888 fatcat:yuo5z7czivaebihrwlto2eb7vy
One of the generalizations of standard VRP is Vehicle Routing Problem with Time Windows (VRPTW) with added complexity of serving every customer within a specified time window. ... Since VRPTW is a NP hard meta heuristics have often been designed for solving it. ... ACKNOWLEDGMENT The authors wish to thank Dr. Chander Mohan from Ambala College of Engineering, ambala, Haryana for his suggestions and corrections. ...doi:10.5815/ijitcs.2015.12.05 fatcat:i322igrztrgzfkqfee5nvjygwq
time Form a final solution by combining the best of the assignment routes, in terms of travelling and vehicle waiting times, with the routes provided by heuristic or meta-heuristic methods applied to ... A greedy look- ahead heuristic for the vehicle routeing problem with time windows. J Opl Res Soc 52: 523-537. G loannou and MN Kritikos—Vehicle routing with time windows Solomon MM (1987). ...doi:10.1057/palgrave.jors.2601659 fatcat:hzf3dhrad5bzbg5ovrpgaxmy2i
The objective of this problem is to find the routes for vehicles to serve all the customers at a minimal cost in terms of the number of routes and the total distance travelled without violating the capacity ... With vast range of applications in real life situations, the Vehicle Routing Problems (VRPs) have been the subject of countless studies since the late 1950s. ... A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet. index of all the nodes in the graph. ...doi:10.14254/jsdtl.2020.5-2.10 fatcat:57aipolrqzax3dlomhu2ssz7tm
All the previous work regarding the topic did not used the combination of these two techniques. Traffic analysis is very important topic because traffic is increasing on the roads day by day. ... It is used to solve a particular variant of the Vehicle Routing Problem the Vehicle Routing Problem with Time Window. ... routing problem with time windows (VRPTW) and the capacitated vehicle routing problem (CVRP) and also their variants. ...doi:10.18535/ijecs/v6i5.26 fatcat:fehjai243jes3mcb2apus6pz74
On the assumption that there is only one depot, the key issue of distribution is generally identified and formulated as VRP standing for Vehicle Routing Problem. ... Carrying out a comprehensive analytical literature survey of past ten years on cost-effective Multi-Depot Vehicle Routing is the main aim of this research. ... Acknowledgments It is with pleasure and gratitude I mention my supervisor Dr G. H. J. Lanel of the Department of Mathematics, University of Sri Jayewardenepura and Dr. Z. A. M. S. ...doi:10.30560/sdr.v3n1p36 fatcat:bwqhpwxmcfa3nlmnslq7dlx5qm
« Previous Showing results 1 — 15 out of 3,751 results