Search Results - (( _ location problems algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- location problems »
- implication based »
- java implication »
-
1
Harmony search algorithm for location-routing problem in supply chain network design
Published 2019“…This paper considers a location-routing problem, which integrates the facility location problem and the vehicle routing problem. …”
Get full text
Get full text
Article -
2
Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
Published 2021“…Third, Alternating Transportation Problem (ATL) was applied to find a new location. …”
Get full text
Get full text
Thesis -
3
Multi-objective harmony search algorithm for capacitated location-routing problem of reverse logistics using fuzzy membership approach
Published 2024“…Location-routing problem is a problem that integrates both facility location problem and vehicle routing problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
Restaurant locator using Djikstra Algorithm / Mohamad Aliff Hakimi Lukman Hakim
Published 2017“…Dijkstra’s algorithm is the technique that can solve the problem by itself. …”
Get full text
Get full text
Thesis -
5
Solving vehicle routing problem by using improved genetic algorithm for optimal solution
Published 2023“…Bus transportation; Buses; Cost reduction; Costs; Education; Genetic algorithms; Location; Optimal systems; Routing algorithms; Students; Transportation; Transportation routes; Vehicle routing; Vehicles; Capacitated vehicle routing problem; Crossover operations; Economic interests; Evaluation criteria; Optimal solutions; Transportation cost; Vehicle routing problem; Vehicle Routing Problems; Problem solving…”
Article -
6
Hybrid harmony search-simulated annealing algorithm for location-inventory-routing problem in supply chain network design with defect and non-defect items
Published 2020“…This paper considers a location-inventory-routing problem (LIRP) that integrates the strategic, tactical, and operational decision planning in supply chain network design. …”
Get full text
Get full text
Get full text
Article -
7
-
8
Modified harmony search algorithm for location-inventory-routing problem in supply chain network design with product returns
Published 2021“…This problem is solved by a proposed Modified Harmony Search (MHS) algorithm with dynamic parameter setting and multi-local neighbourhood search techniques. …”
Get full text
Get full text
Get full text
Article -
9
Evaluating the effectiveness of integrated benders decomposition algorithm and epsilon constraint method for multi-objective facility location problem under demand uncertainty
Published 2017“…One of the most challenging issues in multi-objective problems is finding Pareto optimal points. This paper describes an algorithm based on Benders Decomposition Algorithm (BDA) which tries to find Pareto solutions. …”
Get full text
Get full text
Get full text
Article -
10
Computerised Heuristic Algorithm for Multi-location Lecture Timetabling
Published 2020“…The objective of this study is to design a heuristic model for multi-location timetabling problem. A two-stage heuristic algorithm is proposed to solve the multi-location timetabling problem on MSc HRD coursework programme. …”
Get full text
Get full text
Get full text
Thesis -
11
Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution
Published 2017“…Approach: The approach has been presented based on two phases: firstly, the algorithms have been adapted to solve the research problem, where its procedure is different than the common algorithm. …”
Get full text
Get full text
Get full text
Article -
12
A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem
Published 2020“…The Combinatorial Optimization Problem (COPs) is one of the branches of applied mathematics and computer sciences, which is accompanied by many problems such as Facility Layout Problem (FLP), Vehicle Routing Problem (VRP), etc. …”
Get full text
Get full text
Get full text
Article -
13
AUTOMATIC ROUTE FINDER FOR NEW VISITORS
Published 2006“…If one of the roads in the first shortest path had problems, then the Automatic Route Finder will highlight the new shortest path from the two locations.…”
Get full text
Get full text
Final Year Project -
14
Comparison of anonymous tracker algorithms / Nur Shafikah Mat Daud
Published 2014“…Based on this research, the objectives to be achieved are to identify IP Address of anonymous tracker, to locate IP Address where anonymous tracker location and comparison of anonymous tracker algorithms. …”
Get full text
Get full text
Thesis -
15
Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty
Published 2024“…This thesis considers the low carbon Location-Inventory-Routing Problem (LIRP) by addressing the challenges of demand uncertainty through the application of stochastic and fuzzy methods. …”
Get full text
Get full text
Get full text
Thesis -
16
Differential equation fault location algorithm with harmonic effects in power system
Published 2023“…In this study, several filters were tested to obtain the lowest fault location error to reduce the effect of harmonic components on the developed fault location algorithm. …”
Get full text
Get full text
Get full text
Article -
17
An enhanced distance vector-hop algorithm using new weighted location method for wireless sensor networks
Published 2020“…In the final phase, least squares are employed to address nonlinear equation, which will gain greater location errors. Aimed at addressing problems mentioned above, an enhanced DV-Hop algorithm based on weighted factor, along with new weighted least squares location technique, is proposed in this paper, and it is called WND-DV-Hop. …”
Get full text
Get full text
Get full text
Article -
18
Shortest Path Trajectory System Based on Dijkstra Algorithm
Published 2012“…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
19
Using artificial intelligence search in solving the camera placement problem
Published 2022“…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
Get full text
Get full text
Book -
20
