Solving Dynamic Vehicle Routing Problem with Pickup and Delivery by CLARITY Method

Yavary, Arefeh; Sajedi, Hedieh

doi:10.1109/ines.2018.8523908

Cited by 4 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition to some of the studies mentioned above, RDF subgraph queries are also a class of graph search that can be applied to many scenarios through different forms of optimization. For example, solving dynamic vehicle path problems [6] and also rumor detection in different social network analyses [7]. Moreover, when the method can be applied to network searches, it can help to find the nodes that cause Doppler shifts [8].…”

Section: Related Workmentioning

confidence: 99%

RDF Subgraph Query Based on Common Subgraph in Distributed Environment

Huang

Lai

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

With the gradual development of the network, RDF graphs have become more and more complex as the scale of data increases; how to perform more effective query for massive RDF graphs is a hot topic of continuous research. The traditional methods of graph query and graph traversal produce great redundancy of intermediate results, and processing subgraph collection queries in stand-alone mode cannot perform efficient matching when the amount of data is extremely large. Moreover, when processing subgraph collection queries, it is necessary to iterate the query graph multiple times in the query of the common subgraph, and the execution efficiency is not high. In response to the above problems, a distributed query strategy of RDF subgraph set based on composite relation tree is proposed. Firstly, a corresponding composite relationship is established for RDF subgraph set, then the composite relation graph is clipped, and the redundant nodes and edges of the composite relation graph are deleted to obtain the composite relation tree. Finally, using the composite relation tree, a MapReduce-based RDF subgraph set query method is proposed, which can use parallel in the computing environment, the distributed query batch processing is performed on the RDF subgraph set, and the query result of the RDF subgraph set is obtained by traversing the composite relation tree. The experimental results show that the algorithm proposed in this paper can improve the query efficiency of RDF subgraph set.

show abstract

Section: Related Workmentioning

confidence: 99%

RDF Subgraph Query Based on Common Subgraph in Distributed Environment

Huang

Lai

et al. 2023

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…In recent years, research has been conducted to compare the computational time for job shop problems solved by different algorithms and on different computational setups. These studies aim to determine the relative performance of algorithms and the impact of computer hardware as well as the solution approach on the difficulty of finding the solution combined with determination of the computational times (Fowler and Monch, 2022;Yavary et al, 2018;Winston, 2022). Some researchers have also focused on the impact of the size and the complexity of the problems, known as "curse of dimensionality", suggesting new heuristic methods for optimization problems which otherwise need significantly long computational time (Toragay and Silva, 2021;Shirneshan et.…”

Section: Literature Reviewmentioning

confidence: 99%

A Monte Carlo simulation approach to the gap-time relationship in solving scheduling problem

Toragay

Pouya

2023

Journal of Turkish Operations Management

View full text Add to dashboard Cite

This article presents a study on the job shop problem, a combinatorial optimization problem that models scheduling and resource allocation in industrial settings. The article aims to investigate the relationship between optimality gap and required computational resources, considering various optimality gap levels that are applicable in real-life situations. The study uses a Monte Carlo simulation to analyze the behavior of solvers in solving different sizes of random-generated scheduling problems. The findings of the study offer insights into the worthiness of reaching an optimal solution versus implementing a near-optimal solution and starting the work. The codes used in the study are accessible on the author's GitHub account.

show abstract

“…Cappanera et al, [35] have discussed applications of coverage problems in both private and government sectors. Aboolian et al, [36] and Yavary et al, [37] have examined a generalized version of the covering location problem, which allows for partial coverage of customers. Arabani et al, [26] have comprehensively examined and studied coverage location problems, focusing more on research articles published after the Schilling et al, [38] paper.…”

Section: Maximal Covering Location Problem (Mclp)mentioning

confidence: 99%

Facility Location Optimization For Technical Inspection Centers Using Multi-Objective Mathematical Modeling Considering Uncertainty

Arabahmadi,

Mohammadi,

Samizadeh

et al. 2023

J. Soft. Comput. Decis. Anal.

View full text Add to dashboard Cite

Encountering numerous vehicles on the roads can pose several risks, including a higher probability of accidents. To address these issues, a thorough examination of cars can significantly reduce these dangers. Technical inspection centers play a crucial role in this process and should be easily accessible. To provide the most customer service coverage at the lowest cost of transportation for technical inspection centers, facility location optimization is proposed in this paper. Specifically, we investigate the location of technical inspection centers (TICs) as a maximum coverage problem while minimizing the cost of TIC locations' construction and customers' transportation. To deal with this problem, we propose a robust programming considering our numeric data's uncertainty. Our research contributes to facility location optimization by providing a novel insight into solving the problem using a hybrid mathematical model. It presents a two-objective linear optimization model with binary variables to address this optimization problem. We used the Augmented Epsilon Constraint (AEC) method via the CPLEX solver and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) method for large-scale problems to solve the model. A case study was conducted to test the numerical analysis methodology and several practical problems of varying scales. The final results demonstrate the effectiveness of the proposed approach in meeting the optimality and feasibility robustness criteria. Identifying optimal TIC locations regarding the paper's main objective proves the advantage of using the mentioned innovative methodology.

show abstract

Solving Dynamic Vehicle Routing Problem with Pickup and Delivery by CLARITY Method

Cited by 4 publications

References 19 publications

RDF Subgraph Query Based on Common Subgraph in Distributed Environment

RDF Subgraph Query Based on Common Subgraph in Distributed Environment

A Monte Carlo simulation approach to the gap-time relationship in solving scheduling problem

Facility Location Optimization For Technical Inspection Centers Using Multi-Objective Mathematical Modeling Considering Uncertainty

Contact Info

Product

Resources

About