1,367 research outputs found
On green routing and scheduling problem
The vehicle routing and scheduling problem has been studied with much
interest within the last four decades. In this paper, some of the existing
literature dealing with routing and scheduling problems with environmental
issues is reviewed, and a description is provided of the problems that have
been investigated and how they are treated using combinatorial optimization
tools
Conflict-free dynamic route multi-AGV using dijkstra floyd-warshall hybrid algorithm with time windows
Autonomous Guided Vehicle is a mobile robot that can move autonomously on a route or lane in an indoor or outdoor environment while performing a series of tasks. Determination of the shortest route on an autonomous guided vehicle is one of the optimization problems in handling conflict-free routes that have an influence on the distribution of goods in the manufacturing industry's warehouse. Pickup and delivery processes in the distribution on AGV goods such as scheduling, shipping, and determining the route of vehicle with short mileage characteristics, is very possible to do simulations with three AGV units. There is a windows time limit on workstations that limits shipping. The problem of determining the route in this study is considered necessary as a multi-vehicle route problem with a time window. This study aims to describe the combination of algorithms written based on dynamic programming to overcome the problem of conflict-free AGV routes using time windows. The combined approach of the Dijkstra and Floyd-Warshall algorithm results in the optimization of the closest distance in overcoming conflict-free routes
An Optimal Algorithm to Solve the Combined Task Allocation and Path Finding Problem
We consider multi-agent transport task problems where, e.g. in a factory
setting, items have to be delivered from a given start to a goal pose while the
delivering robots need to avoid collisions with each other on the floor. We
introduce a Task Conflict-Based Search (TCBS) Algorithm to solve the combined
delivery task allocation and multi-agent path planning problem optimally. The
problem is known to be NP-hard and the optimal solver cannot scale. However, we
introduce it as a baseline to evaluate the sub-optimality of other approaches.
We show experimental results that compare our solver with different sub-optimal
ones in terms of regret
Effective Scheduling of Multi-Load Automated Guided Vehicle in Spinning Mill: A Case Study
In the Flexible Manufacturing System (FMS), where material processing is carried out in the form of tasks from one department to another, the use of Automated Guided Vehicles (AGVs) is significant. The application of multiple-load AGVs can be understood to boost FMS throughput by multiple orders of magnitude. For the transportation of materials and items inside a warehouse or manufacturing plant, an AGV, a mobile robot, offers extraordinary industrial capabilities. The technique of allocating AGVs to tasks while taking into account the cost and time of operations is known as AGV scheduling. Most research has exclusively addressed single-objective optimization, whereas multi-objective scheduling of AGVs is a complex combinatorial process without a single solution, in contrast to single-objective scheduling. This paper presents the integrated Local Search Probability-based Memetic Water Cycle (LSPM-WC) algorithm using a spinning mill as a case study. The scheduling model’s goal is to maximize machine efficiency. The scheduling of the statistical tests demonstrated the applicability of the proposed model in lowering the makespan and fitness values. The mean AGV operating efficiency was higher than the other estimated models, and the LSPM-WC surpassed the different algorithms to produce the best result
Recommended from our members
Optimization models and methods for transportation services
Managing transportation services efficiently is essential to both public and private sectors. This dissertation addresses three scheduling problems in modern transportation systems: the network design problem, the train dispatching problem, and the service route design problem. The transportation network design problem with service requirements designs arcs on a directed network and route commodities on the designed arcs so that i) commodities satisfy service requirements and ii) the total cost is minimized. We develop three mathematical programming models: a compact but weak arc-flow formulation, a large but strong path-flow formulation, and a hybrid formulation that uses both the arc-flow and the path-flow representations. We show that the hybrid formulation can significantly strengthen the LP formulation without introducing many variables. To find a good hybrid formulation, we develop columnization and decolumnization algorithms that uses the LP relaxation information to identify commodities that should use the path-flow representation. We also develop valid inequalities for commodities using the path-flow representation. The train dispatching problem schedules the movements of trains on scarce railroad tracks so as to improve the average velocity of trains. We develop a mathematical programming model and strengthen the model using valid inequalities. Besides, we present a heuristic to find a feasible solution quickly, which can serve as the warm-start solution to the MIP solver. For the third problem, we seek to design vehicle routes to deliver and pickup orders for a major grocery chain. We design a GRASP that can incorporate various operational requirements, including warehouse loading capacity, loading sequence, time window requirements, truck volume and weight capacities, and driver time limits. Our GRASP procedure consists of two phases: the solution construction (Phase I) and the Tabu search (Phase II). We show that the neighborhood structure of solutions is highly degenerate, which limits the solution space explored by the Tabu search. We apply the Tabu search with random variable neighborhood to increase the solution space explored.Operations Research and Industrial Engineerin
Conflict-Free Routing of Mobile Robots
The recent advances in perception have enabled the development of more autonomous mobile robots in the sense that they can operate in a more dynamic environment where obstacles surrounding the robot emerge, disappear, and move. The increased perception of Autonomous Mobile Robots (AMRs) allows them to plan detailed on-line trajectories in order to avoid previously unforeseen obstacles, making AMRs useful in dynamic environments where humans, traditional fork-lifts, and also other mobile robots operate. These abilities contributed to increase automation in logistic applications. This thesis discusses how to efficiently operate a fleet of AMRs and make sure that all tasks are successfully completed.Assigning robots to specific delivery tasks and deciding the routes they have to travel can be modelled as a variant of the classical Vehicle Routing Problem (VRP), the combinatorial optimization problem of designing routes for vehicles. In related research it has been extended to scheduling routes for vehicles to serve customers according to predetermined specifications, such as arrival time at a customer, amount of goods to deliver, etc.In this thesis we consider to schedule a fleet of robots such that areas avoid being congested, delivery time-windows are met, the need for robots to recharge is considered, while at the same time the robots have freedom to use alternative paths to handle changes in the environment. This particular version of the VRP, called CF-EVRP (Conflict-free Electrical Vehicle Routing Problem) is motivated by an industrial need. In this work we consider using optimizing general purpose solvers, in particular, MILP and SMT solvers are investigated. We run extensive computational analysis over well-known combinatorial optimization problems, such as job shop scheduling and bin-packing problems, to evaluate modeling techniques and the relative performance of state-of-the-art MILP and SMT solvers.We propose a monolithic model for the CF-EVRP as well as a compositional approach that decomposes the problem into sub-problems and formulate them as either MILP or SMT problems depending on what fits each particular problem best. The performance of the two approaches is evaluated on a set of CF-EVRP benchmark problems, showing the feasibility of using a compositional approach for solving practical fleet scheduling problems
A Review Of Design And Control Of Automated Guided Vehicle Systems
This paper presents a review on design and control of automated guided vehicle systems. We address most key related issues including guide-path design, estimating the number of
vehicles, vehicle scheduling, idle-vehicle positioning, battery management, vehicle routing, and conflict resolution. We discuss and classify important models and results from key publications in literature on automated guided vehicle systems, including often-neglected areas, such as idle-vehicle positioning and battery management. In addition, we propose a decision framework for design and implementation of automated guided vehicle systems, and suggest some fruitful research directions
- …