نتایج جستجو برای: depot vehiclerouting problem with inter

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

A. Dolatnejad M. Yousefikhoshbakht, N. Mahmoodi Darani

The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

Journal: :journal of optimization in industrial engineering 2014
reza kia nikbakhsh javadian reza tavakkoli-moghaddam

in this paper, a mixed-integer linearized programming (minlp) model is presented to design a group layout (gl) of a cellular manufacturing system (cms) in a dynamic environment with considering production planning (pp) decisions. this model incorporates with an extensive coverage of important manufacturing features used in the design of cmss. there are also some features that make the presented...

2014
BAOZHEN YAO PING HU MINGHENG ZHANG XIAOMEI TIAN

This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity ...

2016
Tânia Rodrigues Pereira Ramos Maria Isabel Gomes Ana Paula Barbosa-Póvoa

The present work aims to support tactical and operational planning decisions of reverse logistics systems while considering economic, environmental and social objectives. In the literature, when addressing such systems economic aspects have been often used, while environmental concerns have emerged only recently. The social component is the one less studied and rarely the combination of the thr...

Journal: :ACM Transactions on Knowledge Discovery From Data 2023

In real-world express systems, couriers need to satisfy not only the delivery demands but also pick-up of customers. Delivery and pickup tasks are usually mixed together within integrated routing plans. Such a problem can be abstracted formulated as Vehicle Routing Problem with Mixed Pickup (VRPMDP), which is an NP-hard combinatorial optimization problem. To solve VRPMDP, there three major chal...

Journal: :مدیریت زنجیره تأمین 0
علیرضا عیدی سیدهادی علوی

one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

2015
M. T. Alonso R. Alvarez-Valdes F. Parreño

The mission of logistics is basically to get the right goods or services to the right place, at the right time, and in the desired conditions, while making the greatest contribution to the company [1]. Everyday a distribution company has to decide how to put goods onto pallets according to the customers’ orders and then how to efficiently distribute these pallets among the number of trucks so a...

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 optimization of locating a set of facilities among candidate locations and routing vehicles. In this paper, a mixed integer linear programming model is presented for a two-echelon location-routing problem wit...

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

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