The fuzzy inference approach to solve multi-objective constrained shortest path problem

Sori, Ali Abbaszadeh; Ebrahimnejad, Ali; Motameni, Homayun

doi:10.3233/jifs-191413

Cited by 26 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[35] addressed a Profitable Tour Problem based on mixed-integer programming to elaborate travel itineraries to visit tourist attractions by considering the visitor profile and solved it using the exact branch and cut algorithm and heuristic Tabu search. Sori et al [36] proposed fuzzy inference, that, considering cost, time, and risk factors, finds the optimal solution and the desirable path between origin and destinations. Ref.…”

Section: Related Workmentioning

confidence: 99%

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Ali,

Jiang,

Buzna

2023

PLoS ONE

View full text Add to dashboard Cite

Developing an efficient and economical journey plan in multimodal transportation networks is of significant and fast-growing importance, but it is still an annoying experience for a traveler. This paper aims to find the journey plan at a combined cross-border and inter-regional level when visiting a sequence of cities while utilizing several transport modes to reduce travel costs and planning time. We study a traveling itinerary problem in a scheduled multimodal transportation network with constraints on both arcs and nodes as a new extension of the shortest path problem. We formulate a 0-1 integer linear programming model for the traveling itinerary problem and develop an exact algorithm that finds a combined cross-border and inter-regional low costs journey plan. We present case studies based on real-world transport data to illustrate the usefulness and computational efficiency of the proposed approaches. We compare the results with the previously proposed approach to demonstrate the benefits of multimodal journeys. Finally, we compare the results with the solution obtained by the general-purpose 0-1 integer linear programming solver to evaluate the computational time.

show abstract

Section: Related Workmentioning

confidence: 99%

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Ali,

Jiang,

Buzna

2023

PLoS ONE

View full text Add to dashboard Cite

show abstract

“…Some academics have recently published similar research, and popular study directions for these challenges include modeling optimization and algorithm solutions. Abbaszadeh Sori et al (2020) formulated the mathematical model of the constrained shortest path (SP) problem with three objectives of cost, time and risk where the constraint is on the path length. Their approach proposed for solving the problem under investigation is to use fuzzy inference system which finds optimal solution in comparison to linear programming and genetic algorithm (GA) approaches in less IJICC 16,2 time.…”

Section: Collaborative Slot Secondary Allocationmentioning

confidence: 99%

Collaborative slot secondary allocation based on flight wave operation

Chen

Yang

et al. 2022

IJICC

View full text Add to dashboard Cite

PurposeFlights are often delayed owing to emergencies. This paper proposes a cooperative slot secondary assignment (CSSA) model based on a collaborative decision-making (CDM) mechanism, and the operation mode of flight waves designs an improved intelligent algorithm to solve the optimal flight plan and minimize the total delay of passenger time.Design/methodology/approachTaking passenger delays, transfer delays and flight cancellation delays into account comprehensively, the total delay time is minimized as the objective function. The model is verified by a linear solver and compared with the first come first service (FCFS) method to prove the effectiveness of the method. An improved adaptive partheno-genetic algorithm (IAPGA) using hierarchical serial number coding was designed, combining elite and roulette strategies to find pareto solutions.FindingsComparing and analyzing the experimental results of various scale examples, the optimization model in this paper is greatly optimized compared to the FCFS method in terms of total delay time, and the IAPGA algorithm is better than the algorithm before in terms of solution performance and solution set quality.Originality/valueBased on the actual situation, this paper considers the operation mode of flight waves. In addition, the flight plan solved by the model can be guaranteed in terms of feasibility and effectiveness, which can provide airlines with reasonable decision-making opinions when reassigning slot resources.

show abstract

“…Zero et al [14] modified Martin's Algorithm and A * algorithm to solve a bi-objective POP with a crisp objective and a min-max fuzzy objective. Abbaszadeh et al [34] implemented the fuzzy inference system to find a path considering three objectives while respecting resource constraints. Bagheri et al [35] devised fuzzy efficiency scores to convert fuzzy objectives to a single objective and implemented the data envelopment analysis.…”

Section: Introductionmentioning

confidence: 99%

A deterministic and nature-inspired algorithm for the fuzzy multi-objective path optimization problem

Zhou

2022

Complex Intell. Syst.

View full text Add to dashboard Cite

Increasing evaluation indexes have been involved in the network modeling, and some parameters cannot be described precisely. Fuzzy set theory becomes a promising mathematical method to characterize such uncertain parameters. This study investigates the fuzzy multi-objective path optimization problem (FMOPOP), in which each arc has multiple crisp and fuzzy weights simultaneously. Fuzzy weights are characterized by triangular fuzzy numbers or trapezoidal fuzzy numbers. We adopt two fuzzy number ranking methods based on their fuzzy graded mean values and distances from the fuzzy minimum number. Motivated by the ripple spreading patterns on the natural water surface, we propose a novel ripple-spreading algorithm (RSA) to solve the FMOPOP. Theoretical analyses prove that the RSA can find all Pareto optimal paths from the source node to all other nodes within a single run. Numerical examples and comparative experiments demonstrate the efficiency and robustness of the newly proposed RSA. Moreover, in the first numerical example, the processes of the RSA are illustrated using metaphor-based language and ripple spreading phenomena to be more comprehensible. To the best of our knowledge, the RSA is the first algorithm for the FMOPOP that can adopt various fuzzy numbers and ranking methods while maintaining optimality.

show abstract

The fuzzy inference approach to solve multi-objective constrained shortest path problem

Cited by 26 publications

References 19 publications

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Traveling itinerary problem in a scheduled multimodal transportation network for a fixed sequence of cities

Collaborative slot secondary allocation based on flight wave operation

A deterministic and nature-inspired algorithm for the fuzzy multi-objective path optimization problem

Contact Info

Product

Resources

About