An Approach for the Fast Calculation Method of Pareto Solutions of a Two-objective Network

2015 ◽  
Vol 22 (01) ◽  
pp. 1550005 ◽  
Author(s):  
Natsumi Takahashi ◽  
Tomoaki Akiba ◽  
Shuhei Nomura ◽  
Hisashi Yamamoto
Keyword(s):  
Shortest Path ◽  
Optimization Problem ◽  
Computing Time ◽  
Search Space ◽  
Shortest Path Problem ◽  
Objective Functions ◽  
Pareto Solutions ◽  
Fast Calculation ◽  
Multi Objective ◽  
Other Information

The shortest path problem is a kind of optimization problem and its aim is to find the shortest path connecting two specific nodes in a network, where each edge has its distance. When considering not only the distances between the nodes but also some other information, the problem is formulated as a multi-objective shortest path problem that involves multiple conflicting objective functions. The multi-objective shortest path problem is a kind of optimization problem of multi-objective network. In the general cases, multi-objectives are rarely optimized by a solution. So, to solve the multi-objective shortest path problem leads to obtaining Pareto solutions. An algorithm for this problem has been proposed by using the extended Dijkstra's algorithm. However, this algorithm for obtaining Pareto solutions has many useless searches for paths. In this study, we consider two-objective shortest path problem and propose efficient algorithms for obtaining the Pareto solutions. Our proposed algorithm can reduce more search space than existing algorithms, by solving a single-objective shortest path problem. The results of the numerical experiments suggest that our proposed algorithms reduce the computing time and the memory size for obtaining the Pareto solutions.

Multi-Objective Design Problem of Tire Wear and Visualization of Its Pareto Solutions2

2006 ◽  
Vol 34 (3) ◽  
pp. 170-194 ◽  
Author(s):  
M. Koishi ◽  
Z. Shida
Keyword(s):  
Inverse Problems ◽  
Conceptual Design ◽  
Dimensional Space ◽  
Design Stage ◽  
Objective Functions ◽  
Pareto Solutions ◽  
Design Problems ◽  
Multi Objective ◽  
Design Engineers ◽  
Design Variables

Abstract Since tires carry out many functions and many of them have tradeoffs, it is important to find the combination of design variables that satisfy well-balanced performance in conceptual design stage. To find a good design of tires is to solve the multi-objective design problems, i.e., inverse problems. However, due to the lack of suitable solution techniques, such problems are converted into a single-objective optimization problem before being solved. Therefore, it is difficult to find the Pareto solutions of multi-objective design problems of tires. Recently, multi-objective evolutionary algorithms have become popular in many fields to find the Pareto solutions. In this paper, we propose a design procedure to solve multi-objective design problems as the comprehensive solver of inverse problems. At first, a multi-objective genetic algorithm (MOGA) is employed to find the Pareto solutions of tire performance, which are in multi-dimensional space of objective functions. Response surface method is also used to evaluate objective functions in the optimization process and can reduce CPU time dramatically. In addition, a self-organizing map (SOM) proposed by Kohonen is used to map Pareto solutions from high-dimensional objective space onto two-dimensional space. Using SOM, design engineers see easily the Pareto solutions of tire performance and can find suitable design plans. The SOM can be considered as an inverse function that defines the relation between Pareto solutions and design variables. To demonstrate the procedure, tire tread design is conducted. The objective of design is to improve uneven wear and wear life for both the front tire and the rear tire of a passenger car. Wear performance is evaluated by finite element analysis (FEA). Response surface is obtained by the design of experiments and FEA. Using both MOGA and SOM, we obtain a map of Pareto solutions. We can find suitable design plans that satisfy well-balanced performance on the map called “multi-performance map.” It helps tire design engineers to make their decision in conceptual design stage.

scholarly journals Braille Block Detection via Multi-Objective Optimization from an Egocentric Viewpoint

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2775
Author(s):  
Tsubasa Takano ◽  
Takumi Nakane ◽  
Takuya Akashi ◽  
Chao Zhang
Keyword(s):  
Optimization Problem ◽  
Line Pair ◽  
Objective Functions ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Optimization Framework ◽  
Visually Impaired People ◽  
Comprehensive Comparison ◽  
Basic Characteristics ◽  
Support Devices

In this paper, we propose a method to detect Braille blocks from an egocentric viewpoint, which is a key part of many walking support devices for visually impaired people. Our main contribution is to cast this task as a multi-objective optimization problem and exploits both the geometric and the appearance features for detection. Specifically, two objective functions were designed under an evolutionary optimization framework with a line pair modeled as an individual (i.e., solution). Both of the objectives follow the basic characteristics of the Braille blocks, which aim to clarify the boundaries and estimate the likelihood of the Braille block surface. Our proposed method was assessed by an originally collected and annotated dataset under real scenarios. Both quantitative and qualitative experimental results show that the proposed method can detect Braille blocks under various environments. We also provide a comprehensive comparison of the detection performance with respect to different multi-objective optimization algorithms.

scholarly journals A Comparison of Genetic Representations and Initialisation Methods for the Multi-objective Shortest Path Problem on Multigraphs

2021 ◽  
Vol 2 (3) ◽  
Author(s):  
Lilla Beke ◽  
Michal Weiszer ◽  
Jun Chen
Keyword(s):  
Shortest Path ◽  
Time Budget ◽  
Exact Algorithm ◽  
Simple Graph ◽  
Shortest Path Problem ◽  
Future Application ◽  
Multi Objective ◽  
Trade Offs ◽  
Conflicting Objectives ◽  
Problem Instances

AbstractThis paper compares different solution approaches for the multi-objective shortest path problem (MSPP) on multigraphs. Multigraphs as a modelling tool are able to capture different available trade-offs between objectives for a given section of a route. For this reason, they are increasingly popular in modelling transportation problems with multiple conflicting objectives (e.g., travel time and fuel consumption), such as time-dependent vehicle routing, multi-modal transportation planning, energy-efficient driving, and airport operations. The multigraph MSPP is more complex than the NP-hard simple graph MSPP. Therefore, approximate solution methods are often needed to find a good approximation of the true Pareto front in a given time budget. Evolutionary algorithms have been successfully applied for the simple graph MSPP. However, there has been limited investigation of their applications to the multigraph MSPP. Here, we extend the most popular genetic representations to the multigraph case and compare the achieved solution qualities. Two heuristic initialisation methods are also considered to improve the convergence properties of the algorithms. The comparison is based on a diverse set of problem instances, including both bi-objective and triple objective problems. We found that the metaheuristic approach with heuristic initialisation provides good solutions in shorter running times compared to an exact algorithm. The representations were all found to be competitive. The results are encouraging for future application to the time-constrained multigraph MSPP.

GRACE: A Generational Randomized ACO for the Multi-objective Shortest Path Problem

2011 ◽  
pp. 535-549
Author(s):  
Leonardo C. T. Bezerra ◽  
Elizabeth F. G. Goldbarg ◽  
Luciana S. Buriol ◽  
Marco C. Goldbarg
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Multi Objective

New Algorithms For Multi Objective Shortest Path Problem

OPSEARCH ◽  
2003 ◽  
Vol 40 (4) ◽  
pp. 278-298 ◽  
Author(s):  
V. N. Sastry ◽  
T. N. Janakiraman ◽  
S. Ismail Mohideen
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Multi Objective ◽  
New Algorithms

A memory efficient stochastic evolution based algorithm for the multi-objective shortest path problem

2014 ◽  
Vol 14 ◽  
pp. 653-662 ◽  
Author(s):  
Umair F. Siddiqi ◽  
Yoichi Shiraishi ◽  
Mona Dahb ◽  
Sadiq M. Sait
Keyword(s):  
Shortest Path ◽  
Shortest Path Problem ◽  
Stochastic Evolution ◽  
Multi Objective ◽  
Memory Efficient

scholarly journals Solving the Asymmetry Multi-Objective Optimization Problem in PPPs under LPVR Mechanism by Bi-Level Programing

Symmetry ◽  
2020 ◽  
Vol 12 (10) ◽  
pp. 1667
Author(s):  
Feiran Liu ◽  
Jun Liu ◽  
Xuedong Yan
Keyword(s):  
Optimization Problem ◽  
Optimal Strategies ◽  
Decision Makers ◽  
Multi Objective Optimization ◽  
Pareto Solutions ◽  
Present Value ◽  
Public And Private ◽  
The Public ◽  
Multi Objective ◽  
The Cost

Optimizing the cost and benefit allocation among multiple players in a public-private partnership (PPP) project is recognized to be a multi-objective optimization problem (MOP). When the least present value of revenue (LPVR) mechanism is adopted in the competitive procurement of PPPs, the MOP presents asymmetry in objective levels, control variables and action orders. This paper characterizes this asymmetrical MOP in Stackelberg theory and builds a bi-level programing model to solve it in order to support the decision-making activities of both the public and private sectors in negotiation. An intuitive algorithm based on the non-dominated sorting genetic algorithm III (NSGA III) framework is designed to generate Pareto solutions that allow decision-makers to choose optimal strategies from their own criteria. The effectiveness of the model and algorithm is validated via a real case of a highway PPP project. The results reveal that the PPP project will be financially infeasible without the transfer of certain amounts of exterior benefits into supplementary income for the private sector. Besides, the strategy of transferring minimum exterior benefits is more beneficial to the public sector than to users.

Exploring the Runtime of an Evolutionary Algorithm for the Multi-Objective Shortest Path Problem

2010 ◽  
Vol 18 (3) ◽  
pp. 357-381 ◽  
Author(s):  
Christian Horoba
Keyword(s):  
Evolutionary Algorithm ◽  
Shortest Path ◽  
Fitness Function ◽  
Approximate Solutions ◽  
Shortest Path Problem ◽  
Worst Case ◽  
Multi Objective ◽  
Natural Vector ◽  
Hard Problems ◽  
Vector Valued

We present a natural vector-valued fitness function f for the multi-objective shortest path problem, which is a fundamental multi-objective combinatorial optimization problem known to be NP-hard. Thereafter, we conduct a rigorous runtime analysis of a simple evolutionary algorithm (EA) optimizing f. Interestingly, this simple general algorithm is a fully polynomial-time randomized approximation scheme (FPRAS) for the problem under consideration, which exemplifies how EAs are able to find good approximate solutions for hard problems. Furthermore, we present lower bounds for the worst-case optimization time.

Sign in / Sign up

Export Citation Format

Share Document