A New Approach for Solving Personalized Routing Problems with Fuzzy Constraints

Torres, Marina; Pelta, David A.; Lamata, María Teresa

doi:10.1109/fuzz-ieee.2018.8491639

Cited by 3 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the experimentation, three approaches for obtaining the necessary alpha-cuts were used. The proposed approach, named Conscious, the Adaptive approach presented by [ 16 ], and a uniform approach previously used in [ 20 ], with α = {1, 0.75, 0.5, 0.25, 0}.…”

Section: Resultsmentioning

confidence: 99%

“…Authors who use the parametric approach to solve fuzzy problems usually use a uniform method to establish the aforementioned alpha-cuts, such is the case of [ 7 , 9 , 31 ]. On the other hand, in [ 16 ], an adaptive method is proposed where the alpha-cuts are calculated similarly to a binary search. This method offers certain advantages over the traditional uniform approach.…”

Section: Methodsmentioning

confidence: 99%

“…(a) Obtain a solution for each crisp instance corresponding to each value in A to get the fuzzy solution. Following the idea of [ 16 ], it is only needed to explore the central alpha-cut if the nonrelaxed crisp problem ( A 0 ) and the full relaxed crisp problem ( A n ) are different.…”

Section: Conscious Exploration Strategymentioning

confidence: 99%

“…Usually, the authors define the alpha-cuts based on experience or somehow arbitrarily. The authors of [ 16 ] presented a method to determine the alpha-cuts in a better way, using an adaptive approach similar to a binary search technique. The results showed the advantages of their proposal to give a more meaningful set of solutions to the decision-maker.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance

Sánchez-Ansola

Pérez

Rosete-Suárez

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Combinatorial optimization problems allow for modeling multiple situations in which proper allocation of resources is needed. For some real-world problems, the use of fuzzy elements in the models allows for incorporating certain levels of uncertainty to better approximate such real-world situations. One way to solve combinatorial optimization problems with fuzzy elements is the parametric approach, where it is necessary to define how to explore different relaxation levels using alpha-cuts. Researchers tend to select such alpha-cuts uniformly. The current investigation proposes a novel strategy for selecting alpha-cuts in the School Bus Routing Problem with fuzzy students’ maximum walking distance. This proposal bases its foundations on the number of student-bus stop pairs available according to the different levels of relaxations allowed. Results demonstrate how the proposed strategy gives attractive solutions with more diverse trade-offs, contrasted with other methods in the literature. Furthermore, it decreases the computational cost for those instances where the maximum relaxation does not provide new pairs of students-bus stops.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Methodsmentioning

confidence: 99%

Section: Conscious Exploration Strategymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance

Sánchez-Ansola

Pérez

Rosete-Suárez

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

show abstract

“…[13] presents a fuzzy version of VCSBPP that allows bin overloading thus, increasing the amount of weight to be packed in each bin, but the real impact in the solution needs to be evaluated. In general, it is convenient to explore interesting values of α to produce significant trade-offs between relaxation of the original condition and cost (see an example in the context of routing problems in [24]).…”

Section: Solving Fuzzy Vcsbpp With Partial Packingmentioning

confidence: 99%

fuzzy approach for the variable cost and size bin packing problem allowing incomplete packing

Herrera-Franklin¹,

Rosete

García-Borroto

2021

View full text Add to dashboard Cite

The Variable Cost and Size Bin Packing Problem (VCSBPP) is a known NP-Hard problem that consists in minimizing the cost of all bins used to pack a set of items. There are many real-life applications of the VCSBPP where the focus is to improve the efficiency of the solution method. In spite of the existence of fuzzy approaches to adapt other optimization problems to real life conditions, VCSBPP has not been extensively studied in terms of relaxations of the crisp conditions. In this sense, the fuzzy approaches for the VCSBPP varies from relaxing the capacity of the bins to the items weights. In this paper we address a non-explored side consisting in relaxing the set of items to be packed. Therefore, our main contribution is a fuzzy version of VCSBPP that allows incomplete packing. The proposed fuzzy VCSBPP is solved by a parametric approach. Particularly, a fast heuristic algorithm is introduced that allows to obtain a set of solutions with interesting trade-offs between cost and relaxation of the original crisp conditions. An experimental study is presented to explore the proposed fuzzy VCSBPP and its solution.

show abstract

On the Impact of Fuzzy Constraints in the Variable Size and Cost Bin Packing Problem

Herrera-Franklin¹,

Rosete

García-Borroto

et al. 2020

Information Processing and Management of Uncertainty in Knowledge-Based Systems

Self Cite

View full text Add to dashboard Cite

The Variable Size and Cost Bin Packing Problem (VSCBPP) consists of minimizing the cost of all bins used to pack a set of items without exceeding the bins capacities. It is a well known NP-Hard problem with many practical applications.In this contribution we assume that the capacity of a bin can be understood in a flexible way (so it may allow some overload) thus leading to a fuzzy version of the VSCBPP with fuzzy constraints.We solve the proposed fuzzy VSCBPP by using the parametric approach based on α-cuts, thus defining a set of related crisp problems.By using three different solving algorithms and several instances, we explore the impact of different degrees of relaxation not only in terms of cost, but also in the structure of the solutions.

show abstract

A New Approach for Solving Personalized Routing Problems with Fuzzy Constraints

Cited by 3 publications

References 10 publications

Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance

Conscious Exploration of Alpha-Cuts in the Parametric Solution of the School Bus Routing Problem with Fuzzy Walking Distance

fuzzy approach for the variable cost and size bin packing problem allowing incomplete packing

On the Impact of Fuzzy Constraints in the Variable Size and Cost Bin Packing Problem

Contact Info

Product

Resources

About