Modeling and Solving the Intersection Inspection Rural Postman Problem

2021 ◽  
Author(s):  
Debdatta Sinha Roy ◽  
Adriano Masone ◽  
Bruce Golden ◽  
Edward Wasil
Keyword(s):  
Integer Programming ◽  
Vehicle Routing ◽  
Real World ◽  
Local Governments ◽  
Graph Transformation ◽  
Computational Experiments ◽  
Rural Postman Problem ◽  
Real World Problem ◽  
New Variant ◽  
Better Than

Local governments inspect roads to decide which segments and intersections to repair. Videos are taken using a camera mounted on a vehicle. The vehicle taking the videos proceeds straight or takes a left turn to cover an intersection fully. We introduce the intersection inspection rural postman problem (IIRPP), which is a new variant of the rural postman problem (RPP) that involves turns. We develop integer programming formulations of the IIRPP based on two different graph transformations to generate least-cost vehicle routes. One formulation is based on a new idea of transforming a graph. A second formulation is based on a graph transformation idea from the literature. Computational experiments show that the formulation involving the new graph transformation idea performs much better than the other formulation. We also develop an RPP-based heuristic and a heuristic based on a modified RPP. Heuristic solutions are improved by solving integer programming formulations on an induced subgraph. Computational experiments show that the heuristics based on the modified RPP perform much better than the RPP-based heuristics. The best-performing heuristic generates very good quality IIRPP-feasible routes on large street networks quickly. Summary of Contribution. Our paper addresses a real-world problem faced by local governments during road inspections. The real-world problem that we solve and the methodologies that we use fall at the intersection of computing and operations research. We introduce the intersection inspection rural postman problem, which is a new variant of the rural postman problem that involves turns to capture this real-world scenario. The rural postman problem is an important problem in vehicle routing. Studying new variants of this problem is key to extending the practice and theory of vehicle routing. We develop an integer programming formulation based on a new idea of transforming a graph and also develop heuristics based on the rural postman problem.

scholarly journals Using Congestion Zones for Solving the Time Dependent Vehicle Routing Problem

2020 ◽  
Vol 32 (1) ◽  
pp. 25-38 ◽  
Author(s):  
Tonči Carić ◽  
Juraj Fosin
Keyword(s):  
Vehicle Routing ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Time Delays ◽  
Historical Data ◽  
Time Dependent ◽  
Routing Problem ◽  
Real World Problem ◽  
Independent Case ◽  
Real World Problems

This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by using historical data. The data are used to predict travel times during certain times of the day and derive zones of congestion that can be used by optimization algorithms. A combination of well-known algorithms was adapted to the time dependent setting and used to solve the real-world problems. The adapted algorithm outperforms the best-known results for TDVRP benchmarks. The proposed framework was applied to a real-world problem and results show a reduction in time delays in serving customers compared to the time independent case.

Isoperformance: A Methodology for Human Factors Engineering Design

1986 ◽  
Vol 30 (14) ◽  
pp. 1403-1404
Author(s):  
Marshall B. Jones ◽  
Robert S. Kennedy ◽  
Janet J. Turnage
Keyword(s):  
Engineering Design ◽  
Performance Measures ◽  
Real World ◽  
Environmental Conditions ◽  
Expert Judgment ◽  
Human Factors Engineering ◽  
Applied Psychology ◽  
The Real ◽  
Real World Problem ◽  
Better Than

The literature of applied psychology rarely, if ever, allows an unambiguous answer to a particular problem. Almost always there is a hiatus between what is known and what one wants to know. If the tasks are the same, personnel, performance measures, temporal relations or environmental conditions are different. Oftentimes nothing is quite the same as what has been studied in the literature. Inevitably, these gaps are closed by “expert judgment.” People who are experienced in the field extrapolate from what has been studied to the real-world case in hand. This inevitability is not, however, the end of the matter. Expert judgment can be utilized in many different ways and some ways are better than others. The principal issues are: precisely what are the experts to be asked, how is their consensus to be determined, and how is that consensus to be used relative to the real-world problem in hand. This discussion will describe one way of answering these questions. It is called “isoperformance.” The key feature of this approach is the design of an “ideal experiment.” This experiment then functions as a framework for both what is known in the literature and expert judgment.

scholarly journals A Heuristic Approach for a Real-World Electric Vehicle Routing Problem

Algorithms ◽  
2019 ◽  
Vol 12 (2) ◽  
pp. 45 ◽  
Author(s):  
Mengting Zhao ◽  
Yuwei Lu
Keyword(s):  
Integer Programming ◽  
Vehicle Routing ◽  
Electric Vehicle ◽  
Real World ◽  
Vehicle Routing Problem ◽  
Heuristic Approach ◽  
Neighborhood Search ◽  
Operational Cost ◽  
Real World Data ◽  
Routing Problem

To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services. However, electric energy-based limitations pose a new challenge in designing reasonable visiting routes that are essential for the daily operations of companies. Therefore, this paper investigates a real-world electric vehicle routing problem (VRP) raised by a logistics company. The problem combines the features of the capacitated VRP, the VRP with time windows, the heterogeneous fleet VRP, the multi-trip VRP, and the electric VRP with charging stations. To solve such a complicated problem, a heuristic approach based on the adaptive large neighborhood search (ALNS) and integer programming is proposed in this paper. Specifically, a charging station adjustment heuristic and a departure time adjustment heuristic are devised to decrease the total operational cost. Furthermore, the best solution obtained by the ALNS is improved by integer programming. Twenty instances generated from real-world data were used to validate the effectiveness of the proposed algorithm. The results demonstrate that using our algorithm can save 7.52% of operational cost.

scholarly journals An integer programming approach to a real-world recyclable waste collection problem in Argentina

2017 ◽  
Vol 35 (5) ◽  
pp. 525-533 ◽  
Author(s):  
Gustavo Braier ◽  
Guillermo Durán ◽  
Javier Marenco ◽  
Francisco Wesner
Keyword(s):  
Integer Programming ◽  
Programming Model ◽  
Programming Approach ◽  
Waste Collection ◽  
Collection System ◽  
Routing Problem ◽  
Rural Postman Problem ◽  
Programming Techniques ◽  
Large Municipality ◽  
Better Than

This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

scholarly journals A Modified Jellyfish Search Optimizer with Opposition Based Learning and Biased Passive Swarm Motion

2021 ◽  
Vol 26 (6) ◽  
pp. 577-584
Author(s):  
Jitendra Rajpurohit
Keyword(s):  
Design Optimization ◽  
Real World ◽  
Structure Design ◽  
Fast Convergence ◽  
Truss Structure ◽  
Initial Population ◽  
The Real ◽  
Opposition Based Learning ◽  
Real World Problem ◽  
Better Than

Jellyfish Search Optimizer (JSO) is one of the latest nature inspired optimization algorithms. This paper aims to improve the convergence speed of the algorithm. For the purpose, it identifies two modifications to form a proposed variant. First, it proposes improvement of initial population using Opposition based Learning (OBL). Then it introduces a probability-based replacement of passive swarm motion into moves biased towards the global best. OBL enables the algorithm to start with an improved set of population. Biased moves towards global best improve the exploitation capability of the algorithm. The proposed variant has been tested over 30 benchmark functions and the real world problem of 10-bar truss structure design optimization. The proposed variant has also been compared with other algorithms from the literature for the 10-bar truss structure design. The results show that the proposed variant provides fast convergence for benchmark functions and accuracy better than many algorithms for truss structure design.

Authorship analysis of aliases: Does topic influence accuracy?

2013 ◽  
Vol 21 (4) ◽  
pp. 497-518 ◽  
Author(s):  
ROBERT LAYTON ◽  
PAUL A. WATTERS ◽  
RICHARD DAZELEY
Keyword(s):  
Real World ◽  
Training Data ◽  
Experimental Comparison ◽  
Matching Problem ◽  
The Real ◽  
Real World Problem ◽  
Online Environments ◽  
Authorship Analysis ◽  
Better Than

AbstractAliasesplay an important role in online environments by facilitating anonymity, but also can be used to hide the identity of cybercriminals. Previous studies have investigated this alias matching problem in an attempt to identify whether two aliases are shared by an author, which can assist with identifying users. Those studies create their training data by randomly splitting the documents associated with an alias into two sub-aliases. Models have been built that can regularly achieve over 90% accuracy for recovering the linkage between these ‘random sub-aliases’. In this paper, random sub-alias generation is shown to enable these high accuracies, and thus does not adequately model the real-world problem. In contrast, creating sub-aliases using topic-based splitting drastically reduces the accuracy of all authorship methods tested. We then present a methodology that can be performed on non-topic controlled datasets, to produce topic-based sub-aliases that are more difficult to match. Finally, we present an experimental comparison between many authorship methods to see which methods better match aliases under these conditions, finding that localn-gram methods perform better than others.

Penjadwalan Mesin dengan Metode Integer Linear Programming pada PT. XYZ

2019 ◽  
Vol 2 (2) ◽  
Author(s):  
Fransiskus Lauson Matondang ◽  
Rosnani Ginting
Keyword(s):  
Integer Programming ◽  
Time Delays ◽  
Parallel Machines ◽  
Research Concept ◽  
Total Settlement ◽  
Approach Method ◽  
Additional Costs ◽  
Maximum Completion Time ◽  
Completion Times ◽  
Better Than

PT XYZ sering mengalami keterlambatan waktu karena dalam setiap keterlambatan yang dilakukan selalu ada penalty yang diberikan kepada perusahaan dan hal ini mengakibatkan tambahan biaya , oleh karena itu hal ini harus dihindari dengan membuat penjadwalan yang efisien, dalam hal ini dilakukanlah perbaikan dengan meminimisasi waktu penyelesaian maksimum Cmax pada mesin paralel yang berpola aliran flowshop (dan tidak boleh dilakukan interupsi yang dilakukan pada pekerjaan yang sedang diproses, untuk melakukan pekerjaan lainnya, satu lintasan hanya memproduksi satu produk dan hanya satu produk juga yang dikerjakan secara langsung. Waktu penyelesaian yang berbeda dari setiap mesin dengan pengerjaannya juga adalah masalah yang dihadapi untuk menjadikan mesin mesin ini sesuai menjadi satu penjadwalan yang terintegrasi dengan metode integer programming yang membuat penjadwalan dengan konsep riset operasi dengan metode pendekatan 0-1 utuk menjadi lebih efisien lagi , dihasilkan minimisasi keterlambatan total penyelesaian order dengan 42,28 menit lebih baik dari sebelumnya.   PT XYZ often experiences time delays because in every delay made there is always a penalty given to the company and this results in additional costs, therefore this must be avoided by making efficient scheduling, in this case repairs are carried out by minimizing the maximum completion time of Cmax on parallel machines that are patterned with flowshop flow (and no interruptions should be carried out on the work being processed, to do other work, one track only produces one product and only one product is directly worked. Different completion times of each machine with the workmanship is also the problem faced to make this machine suitable to be one scheduling integrated with integer programming methods that makes scheduling with the operational research concept with the 0-1 approach method to be more efficient, resulting in minimization of the delay in the total settlement of orders with 42.28 minutes was better than before.

Systems theories

2018 ◽  
Author(s):  
Marc J. Stern
Keyword(s):  
Social Networks ◽  
Problem Solving ◽  
Natural Resources ◽  
Real World ◽  
Common Pool Resources ◽  
Ecological Systems ◽  
Effective Governance ◽  
Social Ecological Systems ◽  
Social Ecological ◽  
Real World Problem

This chapter covers systems theories relevant to understanding and working to enhance the resilience of social-ecological systems. Social-ecological systems contain natural resources, users of those resources, and the interactions between each. The theories in the chapter share lessons about how to build effective governance structures for common pool resources, how to facilitate the spread of worthwhile ideas across social networks, and how to promote collaboration for greater collective impacts than any one organization alone could achieve. Each theory is summarized succinctly and followed by guidance on how to apply it to real world problem solving.

scholarly journals Network robustness improvement via long-range links

2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Vincenza Carchiolo ◽  
Marco Grassia ◽  
Alessandro Longheu ◽  
Michele Malgeri ◽  
Giuseppe Mangioni
Keyword(s):  
Complex Networks ◽  
Long Range ◽  
Real World ◽  
Network Robustness ◽  
Scale Free ◽  
Area Of Interest ◽  
Before And After ◽  
Significant Area ◽  
Better Than

AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.

Sign in / Sign up

Export Citation Format

Share Document