[PDF] Top 20 A unified tabu search algorithm for vehicle routing problems with soft time windows

... our unified TS algorithm during the course of multiple experiments are reported in Table 1 for all 56 test prob- lems, using the format: number of routes/total travel distance, percentage of non-violated ... See full document

... hard time windows ...of time windows need not be met, but can be violated. These problems are known as vehicle routing problems with soft time ... See full document

... Mixed-Shift Vehicle Routing Problem is proposed based on a real-life container transportation ...the time constraints. Due to the different travel distances and time of tasks, there are two ... See full document

... MGTS algorithm significantly improves the results obtained by the first phase (first procedure), achieving similar or better objective function values than the current solution applied by the ...satisfy ... See full document

... Harmony search algorithm is relatively a recent nature inspired algorithm that mimics the musical improvisation process in seeking agreeable ...optimization problems and shown to produce good ... See full document

... in vehicle routing problem with hard time windows (Bettinelli et ...practical problems such as vehicle routing problem with soft time windows ... See full document

... The vehicle routing problem with intermediate stops (VRPIS) was introduced by Schneider et ...delivery vehicle. The authors developed an adaptive variable neighborhood search (AVNS) to deal ... See full document

... distribution-logistic problems, namely the fact that several of the problem parameters (demand, time, distance, city location, etc) are often ...a vehicle routing model may generate sub ... See full document

... Vehicle Routing Problem (VRP) is a well-studied topic in Operational Research, and has a large number of ...of Vehicle Routing Problem with Time Windows (VRPTW) (Solomon 1987) ... See full document

... The first, it makes the exchange of two customers of the chosen route of random form. The second is considered as one of the best perturbations for the VRP problems because it performs the exchange of customers in ... See full document

... The vehicle routing problem with time windows (VRPTW) is a crucial issue in transportation and logistics systems [46], ...one vehicle. The routes should satisfy the vehicle ... See full document

... neighborhood search (ALNS) heuristic to integrate into our approach in order to deal with robust ...Neighborhood Search (LNS) heuristic, which was first introduced by Shaw (1998), ALNS is a metaheuristic ... See full document

... a tabu search algorithm ...the algorithm presented here is deterministic and does not require the use of random parameter values (which are also needed for MA), so making the results fully ... See full document

... distribution problems is the reason for the lack of solution techniques able to provide optimal solutions to real cases in a reasonable time ...these problems are generi- cally known as the ... See full document

... An important operation of the memetic algorithm is the crossover operation. In [14], authors propose the Sequence-Based Crossover where each offspring is generated by merging two routes from two different parents. ... See full document

... of Vehicle Routing Problems ...the routing industry is indeed regarded as one of the success stories of ...These problems deal with multi-faceted objective functions, aimed at modelling ... See full document

... of search for this bi-objective problem, producing solutions with higher ...Multi-Objective Vehicle Routing Problem, the Hill Climbing acceptance criterion outperforms the acceptance criterion of ... See full document

... The case study bank has an awareness of the entry of a new competitor into the market and uses a transportation planning as a strategic to overcome the competitor. Cash distribution to bank branches and ATM has to be in ... See full document

... like routing, task allocation, or scheduling such kinds of problems often ...optimization problems of practical as well as theoretical importance consist of the search for a “best” ... See full document

... DE algorithm, if an individual is not selected the information of that individual is lost, but TS algorithm has memory ...DE algorithm the new candidate solution is generated randomly from the ...the ... See full document