نتایج جستجو برای: vehicle routing scheduling

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

Manufacturers, who re-supply a large number of customers, continually struggle with the question of how to formulate a replenishment strategy. The purpose of this paper is to determine the optimal set of routes for a group of vehicles in the transportation network under defined constraints – which is known as the Vehicle Routing Problem (VRP) – delivering new items, and resolving the invent...

2003
Vladimir I. Gorodetski Oleg Karsaev Victor Konushy

The paper considers multi agent approach and respective multi-agent system for resource allocation and scheduling within shipping logistics problem. A well known benchmark that is Vehicle Routing Problem with Time Windows is considered as a case study. The paper proposes an approach to the shipping logistics problem solving that includes auction-based resource allocation and scheduling, distrib...

2015
Vishakha Shukla Ashutosh Pandey Kritika Pandey Mohammed Saim

The coming era of world has moved to an exceptional leading contest of innovations and inspiration. In this paper, an attempt has been made to find out a solution to ensure the safety of route to parents when their child is travelling to school and back to home. Recent years, spatial data and observed data, such as digital road map, traffic route, vehicle speed, recordings events and others are...

Journal: :CIT 2012
Krunoslav Puljic

The capacitated vehicle routing problem (CVRP) is an interesting combinatorial optimization task, which occurs frequently in real-world applications [28]. The problem deals with scheduling a fleet of vehicles to distribute goods between depots and customers. A set of routes for vehicles should be determined, which are in some sense optimal, e.g. the shortest or the cheapest. Certain constraints...

Journal: :European Journal of Operational Research 2017
Christian Tilk Ann-Kathrin Rothenbächer Timo Gschwind Stefan Irnich

With their paper ”Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints” [Discrete Optimization 3, 2006, pp. 255–273] Righini and Salani introduced bounded bidirectional dynamic programming (DP) as an acceleration technique for solving variants of the shortest path problem with resource constraints (SPPRC). SPPRCs must be s...

Journal: :Proceedings of the ... AAAI Conference on Artificial Intelligence 2023

The Sudoku Assistant app is an AI assistant that uses a combination of machine learning and constraint programming techniques, to interpret explain pen-and-paper scanned with smartphone. Although the demo about Sudoku, underlying techniques are equally applicable other solving problems like timetabling, scheduling, vehicle routing.

Journal: :international journal of supply and operations management 2014
shima teimoori hasan khademi zare mohammad saber fallah nezhad

the location-routing problem is a relatively new branch of logistics system. its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. in this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. another important issue in this regard ...

Journal: :Optimization Letters 2013
Panagiotis P. Repoussis Chrysanthos E. Gounaris

The Vehicle Routing Problem (VRP) has become one of the most studied optimization problems in the transportation and operations research literature, with numerous exciting variants and applications encountered in a large variety of practical contexts. In broad terms, vehicle routing and scheduling problems deal with the optimum assignment of a set of customer orders to a fleet of vehicles and t...

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series C 2001

Journal: :Robotics and Autonomous Systems 2017
Ernesto Nunes Marie D. Manner Hakim Mitiche Maria L. Gini

Previous work on assigning tasks to robots has proposed extensive categorizations of allocation of tasks with and without constraints. The main contribution of this paper is a more specific categorization of problems that have both temporal and ordering constraints. We propose a novel taxonomy that builds on the existing taxonomy for multi-robot task allocation and organizes the current literat...

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

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