[PDF] Top 20 A Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy ‎Demands‎

... good routing for this config- ...to solve the multi-depot location rout- ing problem with multiple fleet types and lim- ited number of vehicles for each vehicle ...facility location, ... See full document

... From the literature reviewed, FAHP is a flexible and powerful tool to solve MADM problems. Hence, using FAHP should make a suitable approach to evaluate the global priority weights of each candidate municipality, ... See full document

... Location-Routing Problem (LRP) emerges as one of the hybrid optimization problems in distribution networks in which, total cost of the system would be reduced significantly by simultaneous ... See full document

... level routing (the routing between plants, DC’s, and big clients), 3) the first-level routing, and 4) the second-level routing between DC’s and other clients not included in the first-level ... See full document

... Vehicle Routing Problem can be expressed as the problem of designing optimal collection or delivery routes from one or multiple depots to a number of terrestrially scattered customers or cities, ... See full document

... dual problem with the aim of finding lower and upper bounds of optimal ...for location problems in which both capacity and demand points constraints are relaxed and ...of location problems like ... See full document

... hub location problem and proposed a GA based heuristic to solve this problem under capacitated ...parameters, fuzzy systems were utilized. Yang et al. (2013b) proposed a ... See full document

... centers location problem under fuzzy ...the problem is designed and some properties of the model were ...search algorithm, genetic algorithm and fuzzy simulation ... See full document

... the capacitated location-routing problem with simultaneous pickup and delivery (CLRP- SPD) is ...This problem is a more realistic case of the capacitated ... See full document

... memetic algorithm is used in [15] for approaching a multi- objective version of the CVRPTW to minimize the traveling distance and the number of routes at the same ...multi-objective algorithm to address a ... See full document

... practical routing aspects such as pick-up and delivery, time windows, and stochastic demands may offer interesting research ...CWS algorithm to solve 2D VRPLCs with the objective of minimizing ... See full document

... Finally a new set of large instances was created for testing. These were based on a different road network in Lancashire that had been used in a winter gritting study with 255 vertices and 375 edges. Different ... See full document

... The paper is organized as follows. In Section 2, we briefly review possibility programming for multi- objective linear programming models. Mathematical formulation of the proposed network design problem is ... See full document

... our problem, each cus- tomer could have a unique destination, reducing the scope for efficiency gains through ef- fective ...our problem, the fixed nature of the transit schedule (and its use in creating ... See full document

... carriage routing then Chinese postman difficulties and so ...path problem distillates on finding a track with smallest distance, period, or cost after the source bulge to the terminus ... See full document

... A new harmony vector is generated by using memory consideration, pitch adjustment and random selection that we applied the roulette wheel selection which is one of an operator in the genetic algorithm [17] to ... See full document

... Phase II employs only one kind of message: Move along with the destination asso- ciated with it. When the initiator of the diffusing computation changes its status to waiting, the computation has been finished. Initiator ... See full document

... Uncertain Capacitated Arc Routing Problem (UCARP) is an important optimisation ...solving routing problems under uncertainty, very few have considered UCARP, and none consider collaboration ... See full document

... In this paper we presented a novel mathematical formu- lation to the MPCLSP with setup carry-over. Furthermore, it addressed an extension of previous research of GRASP with path relinking to solve this ... See full document

... the heuristic was not applied and the optimum solution was found by complete ...matching problem by complete enumeration in all ...the heuristic, but surprisingly, the average solutions to the CARP ... See full document