204 Hits in 7.4 sec

Fuzzy Multi-objective Linear Programming Approach

Amna Rehmat, Hina Saeed, Muhammad Shahzad Cheema
2007 Pakistan Journal of Statistics and Operation Research  
Traveling salesman problem (TSP) is one of the challenging real-life problems, attracting researchers of many fields including Artificial Intelligence, Operations Research, and Algorithm Design and Analysis  ...  In this paper, a methodology, for solving a TSP with imprecise parameters, is deployed using fuzzy multi-objective linear programming.  ...  Introduction The Traveling Salesman Problem is well-known among NP-hard combinatorial optimization problems.  ... 
doi:10.18187/pjsor.v3i2.62 fatcat:mcbnicrbrja4tc7ixfz53wojve

Multiple Criteria Decision Making Combined with VRP: A Categorized Bibliographic Study

Yahia Zare Mehrjerdi
2015 International Journal of Supply and Operations Management  
In this research author reviews references related to the topic of multi criterion (goal programming, multiple objective linear and nonlinear programming, bi-criterion programming, Multi Attribute Decision  ...  the problem.  ...  Three excellent volumes have been published on the subject of the traveling salesman problem (Lawler et al., 1985) , on routing and scheduling ) and on vehicle routing problem (Golden and Assad 1984)  ... 
doaj:9e4c7d0f2e8f492bade82b93cbd4ebac fatcat:5oj3hokrffcl3b7unsnbg6njgi

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

Omar Cheikhrouhou, Ines Khoufi
2021 Computer Science Review  
The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it is widely adopted in real-life applications, including robotics, transportation  ...  In this paper, we aim to fill this gap by providing a comprehensive review of existing studies on MTSP.  ...  Another study in [15] extended the problem of multiple traveling salesman problem proposed in [83] .  ... 
doi:10.1016/j.cosrev.2021.100369 fatcat:xnpxosxsdfbb5i6zm5ajlbx4fu

Selective Survey: Most Efficient Models and Solvers for Integrative Multimodal Transport

Oliviu Matei, Rudolf Erdei, Camelia-M. Pintea
2021 Informatica  
The selective survey covers multimodal transport design and optimization in terms of: cost, time, and network topology.  ...  Thus, it is important to have an overview of existing research in this field, to know what has already been done and what is to be studied next.  ...  Multi-criteria shortest path optimization, including time, travel cost and route length, for the NP-complete bus routing problem as in Widuch (2013) could be further extended for complex ITS problems  ... 
doi:10.15388/21-infor449 fatcat:skvfbfchvvehdkr2wfqw4tmdam

Intelligent Fuzzy Multi-Criteria Decision Making: Review and Analysis [chapter]

Waiel F. Abd El-Wahed
2008 Springer Optimization and Its Applications  
This chapter highlights the implementation of artificial intelligence techniques to solve different problems of fuzzy multi-criteria decision making.  ...  In additions, the role of each technique in handling such problem are studied and analyzed.  ...  The adopted fuzzy ANN is applied successfully to multi-group classification-based multi-criteria analysis in the economical field. Searching the Solution Space of Ill-Structured FMCDM Problems  ... 
doi:10.1007/978-0-387-76813-7_2 fatcat:elobnjpw3fg4zhgethfythc5uu

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

Md Ashikur Rahman, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah, Evizal Abdul Kadir
2021 Mathematics  
as vehicle routing problems, traveling salesman problems, and supply chain network design problems.  ...  annealing, particle swarm optimization, and tabu search.  ...  , travelling salesman problems, and supply chain design problems.  ... 
doi:10.3390/math9202633 fatcat:tk2ymswg4fau3bpx2kxmcmmyoi

An improved hybrid algorithm for capacitated fixed-charge transportation problem

C.-M. Pintea, P. C. Pop
2015 Logic Journal of the IGPL  
Intelligence in Multi-Criteria Decision-Making (MCDM), pp. 106-115, 2014.  ...  Diaz, Comparison of a memetic algorithm and a tabu search algorithm for the traveling salesman problem, IEEE Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 131-136,  ... 
doi:10.1093/jigpal/jzv014 fatcat:6boxa6wgmzelpdg5ovbxrteebu

Using Genetic Algorithm with Combinational Crossover to Solve Travelling Salesman Problem

Ammar Al-Dallal
2015 Proceedings of the 7th International Joint Conference on Computational Intelligence  
The article is devoted to the study and development of modified bioinspired algorithm and the experimental studies of its characteristics to solve the travelling salesman problem.  ...  At the best, the time complexity of the algorithm O(nlogn) and in the worst case -o(n ). 3  ...  salesman problem.  ... 
doi:10.5220/0005590201490156 dblp:conf/ijcci/Al-Dallal15 fatcat:hmqfb22azzbxfj4xrunkvuqerm

Cuckoo Search: A Brief Literature Review [chapter]

Iztok Fister, Xin-She Yang, Dušan Fister, Iztok Fister
2013 Studies in Computational Intelligence  
Cuckoo search (CS) was introduced in 2009, and it has attracted great attention due to its promising efficiency in solving many optimization problems and real-world applications.  ...  In the last few years, many papers have been published regarding cuckoo search, and the relevant literature has expanded significantly.  ...  Discrete cuckoo search for traveling salesman problem. [35] Mukul Joshi and Praveen Ranjan Srivastava. Query optimization: An intelligent hybrid approach using cuckoo and tabu search.  ... 
doi:10.1007/978-3-319-02141-6_3 fatcat:253zekb42jccnadtlhwrd7xdiy

Review of soft computing models in design and control of rotating electrical machines

Adrienn Dineva, Amir Mosavi, Sina Faizollahzadeh Ardabili, Istvan Vajda, Shahab Shamshirband, Timon Rabczuk, Kwok-Wing Chau
2020 Zenodo  
Novelty and advancement in the control and high-performance design of these machines are of interests in energy management.  ...  Rotating electrical machines are the electromechanical energy convertors with a fundamental impact on the production and conversion of energy.  ...  The first Ant Colony algorithm was applied for the travelling salesman problem (TSP). Since then, it has been widespread in engineering practice.  ... 
doi:10.5281/zenodo.4056793 fatcat:44twbmjbdjdilfe3quknwql6pi

Review of Soft Computing Models in Design and Control of Rotating Electrical Machines

Adrienn Dineva, Amir Mosavi, Sina Faizollahzadeh Ardabili, Istvan Vajda, Shahaboddin Shamshirband, Timon Rabczuk, Kwok–Wing Chau
2019 Energies  
used in rotating electrical machines.  ...  Rotating electrical machines are electromechanical energy converters with a fundamental impact on the production and conversion of energy.  ...  The first ant colony algorithm was applied for the traveling salesman problem (TSP). Since then, it has been widespread in engineering practice.  ... 
doi:10.3390/en12061049 fatcat:m2kcstyncbfdnbwur7mtqsucsa

Hyper-heuristics: a survey of the state of the art

Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, Rong Qu
2013 Journal of the Operational Research Society  
The definition of hyper-heuristics has been recently extended to refer to a search method or learning mechanism for selecting or generating heuristics to solve computational search problems.  ...  The distinguishing feature of hyper-heuristics is that they operate on a search space of heuristics (or heuristic components) rather than directly on the search space of solutions to the underlying problem  ...  Travelling salesman problem Keller and Poli (2007b) present a linear genetic programming hyper-heuristic for the travelling salesman problem.  ... 
doi:10.1057/jors.2013.71 fatcat:wgusktpk4fau3lg22smrby4k4y

A Calculation Model of Hierarchical Multiplex Structure with Fuzzy Inference for VRSD Problem [chapter]

Kewei Chen, Fangyan Dong, Kaoru Hirota
2020 Studies in Fuzziness and Soft Computing  
A concept of the VRSD problem (Vehicle Routing, Scheduling and Dispatching Problem) and its formularization are proposed in order to bridge the gap between conventional methods and complex situations in  ...  The experimental results and the evaluations by experts from practice show that the HIMS model provides a feasible, fast, and efficient tool for the application in the real world VRSD problem.  ...  After each operation, the shortest route calculation [TSP: Traveling Salesman Problem (Eq. 29)] is done for the updated trips and the feasible solution is searched, which can decrease the working time.  ... 
doi:10.1007/978-3-030-38893-5_9 fatcat:is4z6g4gyfbojjs2aggdu5fw54

A survey of search methodologies and automated system development for examination timetabling

R. Qu, E. K. Burke, B. McCollum, L. T. G. Merlot, S. Y. Lee
2008 Journal of Scheduling  
In this paper we present a critical discussion of the research on exam timetabling in the last decade or so.  ...  Examination timetabling is one of the most important administrative activities that takes place in all academic institutions.  ...  Wren [161] in 1996 illustrated a useful and interesting link between scheduling, timetabling and rostering by studying an example of the Travelling Salesman Problem.  ... 
doi:10.1007/s10951-008-0077-5 fatcat:jt6nwwl4s5eh7kqepq7oksaaq4

Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm

Alireza Rahimi-Vahed, Teodor Gabriel Crainic, Michel Gendreau, Walter Rei
2015 Computers & Operations Research  
Cordeau et al. [1997] proposed a tabu search heuristic for the PVRP that can also be used to solve the Multi-Depot Vehicle Routing Problem and the Periodic Traveling Salesman Problem (PTSP).  ...  The modular heuristic clearly outperforms the unified tabu search on the majority of problem instances.  ... 
doi:10.1016/j.cor.2014.07.004 fatcat:zhxda5v6gzg4pi2zd7c4etzf4a
« Previous Showing results 1 — 15 out of 204 results