نتایج جستجو برای: bi objective location routing problem

تعداد نتایج: 1645507  

Journal: :Computers & OR 2015
Ismail Karaoglan Fulya Altiparmak

In this paper, a hybrid genetic algorithm is proposed to solve a Capacitated Location-Routing Problem. The objective is to minimize the total cost of the distribution in a network composed of depots and customers, both depots and vehicles have limited capacities, each depot has a homogenous vehicle fleet and customers’ demands are known and must be satisfied. Solving this problem involves makin...

Journal: :European Journal of Operational Research 2016
Çagri Koç Tolga Bektas Ola Jabali Gilbert Laporte

This paper introduces the fleet size and mix location-routing problem with time windows (FSMLRPTW) which extends the location-routing problem by considering a heterogeneous fleet and time windows. The main objective is to minimize the sum of vehicle fixed cost, depot cost and routing cost. We present mixed integer programming formulations, a family of valid inequalities and we develop a powerfu...

2007
Joseph M. Pasia Karl F. Doerner Richard F. Hartl Marc Reimann

In this paper we propose the application of Pareto ant colony optimization (PACO) in solving a bi-objective capacitated vehicle routing problem with route balancing (CVRPRB). The objectives of the problem are minimization of the tour length and balancing the routes. We propose PACO as our response to the deficiency of the Pareto-based local search (P-LS) approach which we also developed to solv...

Journal: :CoRR 2011
Thibaut Barthélemy Martin Josef Geiger Marc Sevaux

The solution of the biobjective IRP is rather challenging, even for metaheuristics. We are still lacking a profound understanding of appropriate solution representations and effective neighborhood structures. Clearly, both the delivery volumes and the routing aspects of the alternatives need to be reflected in an encoding, and must be modified when searching by means of local search. Our work c...

Journal: :Pesquisa Operacional 2022

In this paper, we investigate the bi-objective multiperiod one-dimensional cutting stock problem that seeks to minimize cost of production associated with total length cut objects (waste) and inventory costs related items. A mathematical model is presented heuristically solved by a column generation method. Computational tests were performed using Weighted Sum method, ε-Constraint method variat...

Journal: :international journal of environmental research 0
sh. afandizadeh faculty of civil engineering, iran university of science and technology, iran n. kalantari faculty of civil engineering, iran university of science and technology, iran h. rezaeestakhruie faculty of civil engineering, sharif university, iran

nowadays, the environmental impact of transportation project and, especially air pollution impacts, are major concerns in evaluating transportation projects. based on this concern, beside definition of traditional objective functions like total travel time and total investment cost, different type of environmental related function is considered as objective function in urban network design. in ...

Journal: :Research in Computing Science 2016
Angélica Tenahua Elías Olivares Benitez Jorge Esparza

This paper presents a methodology for solving the Periodic Vehicle Routing Problem (PVRP). Customer locations each with a certain daily demand are known, as well as the capacity of vehicles. In this work, the problem is solved by means of a two-phase heuristic. The first phase is the itinerary assignment to visit each customer, and in the second phase the routing is done for each day of the iti...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید