[PDF] Top 20 A PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows

... a time window during which it must receive the ...soft time windows, time frames can be violated but a penalty must be paid for each ...travel time and the second has been used to ... See full document

... a time, one container represents one transport ...the problem model and make the prevailing neigh- bourhood search heuristics applicable, the node-based method of [7], instead of the PDDL, is ... See full document

... The VRP is a very important NP-hard optimization problem that arises in the management of smart cities. Several variants of EAs have shown great promise in dealing with the VRP. However, when dealing with ... See full document

... salesman problem and from then many hundreds of research works have been published on several variants of ...bus routing, garbage collection, private travels operation, courier service applications and many ... See full document

... a time-dependent model for a VRPTW, based on time-dependent travel speeds, computed dividing the planning horizon into three time ...search heuristic devel- oped by Taillard et al. [26] ... See full document

... pollution- routing problem (PRP) and considered the tradeoffs between various parameters such as vehicle load, speed and total cost, and offered insight on the economics of "environmental- friendly" ... See full document

... hyper-heuristics, time complexity cannot be determined since these approximate algorithms do not guar- antee finding the global optimal solution within a given time ...applied problem and specific ... See full document

... vehicle routing problem (SVRP) with capacity constraint for multi- product ...vehicle routing scheduling problems with multiple cross-docking centers due to potential applications in the distribution ... See full document

... practical routing aspects such as pick-up and delivery, time windows, and stochastic demands may offer interesting research ...randomization based algorithms and a CWS algorithm to solve 2D ... See full document

... vehicle routing problem dependent on time and used simulated annealing algorithm to solve the model (Kucukoglu et ...vehicle routing and carbon dioxide emissions and calculatedthe amount of ... See full document

... formulations based on stochastic programming were proposed. A heuristic algorithm based on Tabu Search was developed to obtain the results ...the time window violations and the overtime of the ... See full document

... (ALNS) heuristic to integrate into our approach in order to deal with robust ...(LNS) heuristic, which was first introduced by Shaw (1998), ALNS is a metaheuristic proposed by Ropke and Pisinger ...is ... See full document

... Travel time or travel distance minimisation strategy was based on the search of distant regions in order to obtain a robust exploration of the search ...travel time and distance with fewer ...overall ... See full document

... Vehicle Routing Problems (VRPs). Vehicle routing problems are widespread in distribution and logistics ...assignment problem, travelling salesman problem and vehicle-path problem ... See full document

... dial-a-ride problem is a subclass of vehicle routing problems with pick-up and delivery requirements, a problem that has been shown to be ...dial-a-ride problem, customers make pick-up and / ... See full document

... Vehicle Routing Problem ( VRP ) , proposed by Dantzig and Ramser [ 1 ] , is an important re- search area in operation search given its impor- tance in logistic ...Vehicle Routing Problem ( ... See full document

... new problem. The first heuristic is a Modified Clarke and Wright Savings algorithm (MCWS) which creates routes by establishing feasibility through the insertion of AFSs, merging feasible routes according to ... See full document

... meta heuristic for the ...meta heuristic to handle large scale ...search heuristic to solve a large-scale HVRPTW in which the vehicles are allowed to have ...the problem. Their algorithm is ... See full document

... studied time window constrained routing and scheduling problems in ...search heuristic for the vehicle routing problem with soft time ...vehicle routing problem ... See full document

... total time taken to cover the entire tour. The problem lies in finding an efficient GA-based meta-heuristic which is more efficient than existing ...The problem that has been considered ... See full document