A transportation problem formulation for the MAC Airlift Planning problem

1994 ◽  
Vol 50 (1) ◽  
pp. 505-523 ◽  
Author(s):  
Harold K. Rappoport ◽  
Laurence S. Levy ◽  
Katherine Toussaint ◽  
Bruce L. Golden
Keyword(s):  
Transportation Problem ◽  
Problem Formulation ◽  
Planning Problem ◽  
Airlift Planning

ASIF Approach to Solve the Green Traveling Salesman Problem

2018 ◽  
Vol 9 (1) ◽  
pp. 81-95 ◽  
Author(s):  
Ahmed Haroun Sabry ◽  
Jamal Benhra ◽  
Abdelkabir Bacha
Keyword(s):  
Objective Function ◽  
Ant Colony Optimization ◽  
Present Article ◽  
Traveling Salesman Problem ◽  
Real World ◽  
Transportation Problem ◽  
Problem Formulation ◽  
Traveling Salesman ◽  
Web Based ◽  
The City

The present article describes a contribution to solve transportation problems with green constraints. The aim is to solve an urban traveling salesman problem where the objective function is the total emitted CO2. We start by adapting ASIF approach for calculating CO2 emissions to the urban logistics problem. Then, we solve it using ant colony optimization metaheuristic. The problem formulation and solving will both work under a web-based mapping platform. The selected problem is a real-world NP-hard transportation problem in the city of Casablanca.

scholarly journals On the Traveling Salesman Problem in Nautical Environments: an Evolutionary Computing Approach to Optimization of Tourist Route Paths in Medulin, Croatia

2019 ◽  
Vol 57 (1) ◽  
pp. 71-87 ◽  
Author(s):  
Sandi Baressi Šegota ◽  
Ivan Lorencin ◽  
Kazuhiro Ohkura ◽  
Zlatan Car
Keyword(s):  
Traveling Salesman Problem ◽  
Optimal Path ◽  
Solution Space ◽  
Evolutionary Computing ◽  
Problem Formulation ◽  
Computing Methods ◽  
Traveling Salesman ◽  
Planning Problem ◽  
Extensive Search ◽  
The Traveling Salesman Problem

The Traveling salesman problem (TSP) defines the problem of finding the optimal path between multiple points, connected by paths of a certain cost. This paper applies that problem formulation in the maritime environment, specifically a path planning problem for a tour boat visiting popular tourist locations in Medulin, Croatia. The problem is solved using two evolutionary computing methods – the genetic algorithm (GA) and the simulated annealing (SA) - and comparing the results (are compared) by an extensive search of the solution space. The results show that evolutionary computing algorithms provide comparable results to an extensive search in a shorter amount of time, with SA providing better results of the two.

Pipesworld: Applying Planning Systems to Pipeline Transportation

2004 ◽  
Author(s):  
Ruy L. Milidiu´ ◽  
Frederico dos Santos Liporace
Keyword(s):  
Artificial Intelligence ◽  
Transportation Problem ◽  
General Purpose ◽  
Benchmark Problems ◽  
Planning Problem ◽  
Due Dates ◽  
Planning Systems ◽  
Pipeline Transportation ◽  
Specific Knowledge ◽  
Artificial Intelligence Planning

Most transportation problems consist of moving carriers of stationary cargo. Pipelines are unique in the sense that they are stationary carriers of moving cargo. As a consequence, the planning problem of these systems has singularities that make it very challenging. In this paper we present the Pipesworld model, a transportation problem inspired by the transportation of petroleum derivatives in Petrobras’ pipelines. Pipesworld takes into account important features like product interface constraints, limited product storage capacities and due dates for product delivery. The relevance and unique characteristics of Pipesworld has been recognized by the Artificial Intelligence planning community. Pipesworld has been selected as one of the benchmark problems to be used in the Fourth International Planning Competition, a biannual event to benchmark the state-of-the-art general purpose artificial planning systems. We report the results obtained by general purpose artificial intelligence planning systems when applied to the Pipesworld instances. We also analyze how different modelling techniques may be used to significantly improve the planners’ performance. Although the basic algorithms of these planners do not incorporate any specific knowledge about the pipeline transportation problem, the results obtained so far are quite satisfactory. We also describe our current work in developing Plumber, a dedicated solver, aimed to tackle effective operational situations. Plumber uses general purpose planning techniques but also incorporates domain specific knowledge and may work together with a human expert during the planning process. By applying Plumber to the Pipesworld instances, we compare its performance against general purpose planning systems. Preliminary tests with a first version of Plumber shows that it already outperforms Fast-Forward (FF), one of the best available general purpose planning systems. This shows that improved versions of Plumber have the potential to effectively deal with pipeline transportation operational scenarios.

scholarly journals The Airlift Planning Problem

2019 ◽  
Vol 53 (3) ◽  
pp. 773-795
Author(s):  
Dimitris Bertsimas ◽  
Allison Chang ◽  
Velibor V. Mišić ◽  
Nishanth Mundru
Keyword(s):  
Large Scale ◽  
Programming Model ◽  
Simulated Data ◽  
Mixed Integer ◽  
Planning Problem ◽  
Weight Restrictions ◽  
Total Delay ◽  
Data Set ◽  
Scale Optimization ◽  
Airlift Planning

The U.S. Transportation Command (USTRANSCOM) is responsible for planning and executing the transportation of U.S. military personnel and cargo by air, land, and sea. The airlift planning problem faced by the air component of USTRANSCOM is to decide how requirements (passengers and cargo) will be assigned to the available aircraft fleet and the sequence of pickups and drop-offs that each aircraft will perform to ensure that the requirements are delivered with minimal delay and with maximum utilization of the available aircraft. This problem is of significant interest to USTRANSCOM because of the highly time-sensitive nature of the requirements that are typically designated for delivery by airlift, as well as the very high cost of airlift operations. At the same time, the airlift planning problem is extremely difficult to solve because of the combinatorial nature of the problem and the numerous constraints present in the problem (such as weight restrictions and crew rest requirements). In this paper, we propose an approach for solving the airlift planning problem faced by USTRANSCOM based on modern, large-scale optimization. Our approach relies on solving a large-scale mixed-integer programming model that disentangles the assignment decision (which aircraft will pickup and deliver which requirement) from the sequencing decision (in what order the aircraft will pickup and deliver its assigned requirements), using a combination of heuristics and column generation. Through computational experiments with both a simulated data set and a planning data set provided by USTRANSCOM, we show that our approach leads to high-quality solutions for realistic instances (e.g., 100 aircraft and 100 requirements) within operationally feasible time frames. Compared with a baseline approach that emulates current practice at USTRANSCOM, our approach leads to reductions in total delay and aircraft time of 8%–12% in simulated data instances and 16%–40% in USTRANSCOM’s planning instances.

scholarly journals Peak-Hour Vehicle Routing for First-Mile Transportation: Problem Formulation and Algorithms

2020 ◽  
Vol 21 (8) ◽  
pp. 3308-3321
Author(s):  
Guiyuan Jiang ◽  
Siew-Kei Lam ◽  
Fangxin Ning ◽  
Peilan He ◽  
Jidong Xie
Keyword(s):  
Vehicle Routing ◽  
Transportation Problem ◽  
Problem Formulation

Path constrained time-optimal motion of a cooperative two robot system

Robotica ◽  
1995 ◽  
Vol 13 (4) ◽  
pp. 363-374 ◽  
Author(s):  
Hye-Kyung Cho ◽  
Bum-Hee Lee ◽  
Myoung-Sam Ko
Keyword(s):  
Motion Planning ◽  
Optimal Solution ◽  
Problem Formulation ◽  
Planning Problem ◽  
Optimal Motion ◽  
Robot System ◽  
Admissible Region ◽  
Time Motion ◽  
State Dependent ◽  
Time Optimal

SummaryThis paper presents a systematic approach to the time-optimal motion planning of a cooperative two robot system along a prescribed path. First, the minimum-time motion planning problem is formulated in a concise form by parameterizing the dynamics of the robot system through a single variable describing the path. The constraints imposed on the input actuator torques and the exerted forces on the object are then converted into those on that variable, which result in the so-called admissible region in the phase plane of the variable. Considering the load distribution problem that is also involved in the motion, we present a systematic method to construct the admissible region by employing the orthogonal projection technique and the theory of multiple objective optimization. Especially, the effects of viscous damping and state-dependent actuator bounds are incorporated into the problem formulation so that the case where the admissible region is not simply connected can be investigated in detail. The resultant time-optimal solution specifies not only the velocity profile, but also the force assigned to each robot at each instant. Physical interpretation on the characteristics of the optimal actuator torques is also included with computer simulation results.

scholarly journals Pelaksanaan Peraturan Daerah Tata Ruang Kabupaten Gianyar Terhadap Pembangunan Fasilitas Pariwisata Sempadan Sungai Ayung

2021 ◽  
Vol 2 (1) ◽  
pp. 62-67
Author(s):  
I Kadek Darmayasa ◽  
I Pt Gd Seputra Luh ◽  
Putu Suryani
Keyword(s):  
Spatial Planning ◽  
Negative Impact ◽  
Problem Formulation ◽  
Spatial Layout ◽  
Planning Problem ◽  
Land Use Patterns ◽  
Use Patterns ◽  
Scientific Papers ◽  
Spatial Use ◽  
Spatial Plan

Tackling the negative impact on the environment and in order to create a good spatial layout of the Regency of Gianyar, it is necessary to control the use of space. Control of spatial use can be done through spatial zoning, licensing, intensive and disintensive spatial planning. Problem Formulation (1) What is the arrangement for the construction of river border tourism facilities? (2) How is the Implementation of Regional Regulation Number 16 of 2012 Concerning Spatial Planning in Gianyar Regency in the construction of tourism facilities? The method of writing scientific papers uses Empirical law. This research chooses the location in Banjar Kedewatan Anyar, Kedewatan Village, Ubud District, Gianyar Regency which is one of the areas traversed by the Ayung River, the development of tourism supporting facilities in the form of hotels, villas, home stays and many others in its implementation refer to the Act Law Number 26 of 2007 Concerning Spatial Planning Article 6 Paragraph 1 and for the distance regulated in Regional Regulation Number 16 of 2012 concerning Spatial Planning for the Gianyar Regency in Article 37 paragraph 2 which states that the distance of the river border, the Spatial Planning Rules can be it has been calculated that 89% has been running well and 11% of the existing spatial plan deviations are due to the lack of preparation and even tend not to seriously consider the reality of traditional land use patterns that develop traditionally in the community.

Sign in / Sign up

Export Citation Format

Share Document