A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Using Synchronizing Heuristics to Construct Homing Sequences
2019
Proceedings of the 7th International Conference on Model-Driven Engineering and Software Development
Preserved Fulltext
By applying synchronizing heuristics on this automaton we get short homing sequences. Furthermore, we adapt some of the synchronizing heuristics to construct homing sequences. ...
Computing a shortest synchronizing sequence of an automaton is an NP-Hard problem. There are well-known heuristics to find short synchronizing sequences. ...
Section 3 shows how we form the relation between the synchronizing sequences and the homing sequences. ...
doi:10.5220/0007403503640371
dblp:conf/modelsward/CirisciESKY19
fatcat:fjaxzzmwazesrlpducms2h4ogq
A SURVEY OF THE VEHICLE ROUTING PROBLEM IN-HOME HEALTH CARE SERVICES
2021
Proceedings on Engineering Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
relate mainly to the context of logistics in the home care and services. then we will details the main works existing related to routing problems that have similarities to the field we are interested ...
whose effectiveness has been proven on the logistics problem of transport in general. ...
and to minimize the time related to nurses movements and the non-satisfaction ratio of patients/nurses. ...
doi:10.24874/pes03.04.003
fatcat:6m4lnyt2lvdvdgudscyfytdc4i
A robust heuristic algorithm for multiple-customers coordinated scheduling of delivery and inventory problem
2015
IFAC-PapersOnLine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this work, we tackle the problem of integrated delivery-inventory for the supply of multi-items to more than one customer, after its production by a manufacturer to minimize the total delivery and storage ...
Abstract: In this work, we tackle the problem of integrated delivery-inventory for the supply of multi-items to more than one customer, after its production by a manufacturer to minimize the total delivery ...
Then, In Section 4, we describe the proposed heuristic of the problem. ...
doi:10.1016/j.ifacol.2015.06.339
fatcat:puciextcrja7zga2e5semnocrm
A Compound Scheduling Strategy for Irregular Array Redistribution in Cluster Based Parallel System
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, a two-step communication cost modification (T2CM) and a synchronization delay-aware scheduling heuristic (SDSH) are proposed to normalize the communication cost and reduce transmission delay ...
With the advancement of network and techniques of clusters, joining clusters to construct a wide parallel system becomes a trend. ...
number of minimal steps. ...
doi:10.1007/978-3-642-14822-4_8
fatcat:b4quicqlm5h6ppdim4lw4czvtm
Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
2008
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The temporal constraints allow for imposing pairwise synchronization and pairwise temporal precedence between customer visits, independently of the vehicles. ...
We also propose an optimization based heuristic to solve real size instances. The results of numerical experiments substantiate the importance of the temporal constraints in the solution approach. ...
Solution quality from heuristic We solved the instances 1-5 with all variables with OPT and with a time limit of 60 minutes with the three objectives, minimize preferences, minimize traveling time and ...
doi:10.1016/j.ejor.2007.07.033
fatcat:qirzcm3l7rf2lbz4752otize3m
A review of public transport transfer coordination at the tactical planning phase
2021
Transportation Research Part C: Emerging Technologies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
First, four solution approaches for solving the transfer coordination design problem (TCDP) are identified and reviewed in detail, namely heuristic rule-based, analytical modelling, mathematical programming ...
While transferring between public transport services has a negative impact on the level-of-service, it is an inevitable feature of public transport networks. ...
of China. ...
doi:10.1016/j.trc.2021.103450
fatcat:vwjpnanksrcw7jzyf4uq2vzklm
Know Thy Simulation Model: Analyzing Event Interactions for Probabilistic Synchronization in Parallel Simulations
2012
Proceedings of the Fifth International Conference on Simulation Tools and Techniques
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Existing synchronization algorithms typically do not analyze event interactions within the simulation model -mainly to minimize runtime overhead and complexity. ...
However, we argue that disregarding event interactions results in a lack of insight into the behavior of the simulation model, thereby severely limiting synchronization efficiency and thus parallel performance ...
Acknowledgments: This research was funded by the DFG Cluster of Excellence on Ultra High-Speed Mobile Information and Communication (UMIC), German Research Foundation grant DFG EXC 89. ...
doi:10.4108/icst.simutools.2012.247716
dblp:conf/simutools/KunzSGW12
fatcat:gzm72hhfa5ezlepzyder322sju
Flowshop scheduling problem with parallel semi-lines and final synchronization operation
2019
Computers & Operations Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The objective is to determine a schedule that minimizes the makespan for a given set of jobs. ...
The shop floor environment is composed of two parallel semi-lines and a final synchronization operation. ...
However, the final synchronization operation of a job can only start when its halves are completed in both semi-lines. The objective is to minimize the makespan. ...
doi:10.1016/j.cor.2019.04.011
fatcat:pwosiv7vt5eyxeczzxa2dzfuum
A Comparison between Genetic Algorithms and Simulated Annealing for Minimizing Transfer Waiting Time in Transit Systems
2016
International Journal of Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Typically, network-wide minimization of transfer waiting time is a highly complex optimization problem, particularly in the case of dealing with huge transit networks. ...
Amathematical model is presented in this study for minimizing the total transfer waiting time in transit systems. ...
Another approach was developed in [5] for minimizing transferwaiting time between railway lines throughan optimization-based heuristic algorithm. ...
doi:10.7763/ijet.2016.v8.888
fatcat:ruusp26ufjdxjjox6dfyy7fcsi
A Comparison between Genetic Algorithms and Simulated Annealing for Minimizing Transfer Waiting Time in Transit Systems
2016
International Journal of Engineering and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Typically, network-wide minimization of transfer waiting time is a highly complex optimization problem, particularly in the case of dealing with huge transit networks. ...
Amathematical model is presented in this study for minimizing the total transfer waiting time in transit systems. ...
Another approach was developed in [5] for minimizing transferwaiting time between railway lines throughan optimization-based heuristic algorithm. ...
doi:10.7763/ijet.2016.v6.888
fatcat:b6tyucyyzfgxpbicnlebxnrroy
Software Environment for Computer-Aided Heuristic Optimization of Hydraulic Systems for Synchronous Movement of Actuators of Various Functional Purposes
2019
Journal of Physics, Conference Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The criterion of an optimization procedure was the minimization of a mismatch time of relative movement of actuators during operation. ...
A compute core of an object-oriented code was constructed on the basis of a dynamic mathematical model of a synchronization system consisting of four power cylinders. ...
physical quantities included in the system (1)-(2) are given in [1] . problem of minimization of a time of relative movement for four actuators of the throttle synchronization system includes the function ...
doi:10.1088/1742-6596/1391/1/012141
fatcat:oew56odnx5awdfhakjuqpgvrh4
Dynamic Memory Management in the Loci Framework
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
While management of processing resources to increase performance is the most critical, efficient management of memory resources plays an important role in solving large problems. ...
In such systems, some sort of automatic resource management is a requirement. We present an automatic memory management scheme that provides good compromise between memory utilization and speed. ...
Acknowledgments The financial support of the National Science Foundation (ACS-0085969), NASA GRC (NCC3-994), and NASA MSFC (NAG8-1930) is gratefully acknowledged. ...
doi:10.1007/11428848_101
fatcat:letzi2iw7jb2remomk6dbcjsui
An adaptive large neighborhood search heuristic for multi-commodity two-echelon vehicle routing problem with satellite synchronization
2022
Journal of Industrial and Management Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The MC-2E-VRPSS integrates satellite synchronization constraints and time window constraints for satellites on the two-echelon network and aims to determine cost-minimizing routes for the two echelons. ...
Furthermore, the computation experiments for evaluating the applicability of the ALNS heuristic compared with large neighborhood search (LNS) on a set of large-scale instances are also conducted, which ...
Drexl [17] presents an exhaustive survey of applications of VRP with various synchronization constraints. The 2E-VRP as the main framework of the MC-2E-VRPSS relates to our works. ...
doi:10.3934/jimo.2021225
fatcat:4rpoesuuprhovgl45s64fxfoym
Smart Reduction
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
It consists in building the behaviour graph by incrementally composing and minimizing parts of the composition modulo an equivalence relation. ...
Heuristics have been proposed for finding an appropriate composition order that keeps the size of the largest intermediate graph small enough. ...
Replacing an Lts by its smallest representative with respect to an equivalence relation is called minimizing the Lts modulo this relation. ...
doi:10.1007/978-3-642-19811-3_9
fatcat:qovzw7pv7ba7veoawo2w7htau4
A method for parallel scheduling of multi-rate co-simulation on multi-core platforms
2019
Oil & Gas Science and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We propose an algorithm and a heuristic for computing a schedule which minimizes the total execution time of the co-simulation. ...
We propose an exact algorithm and a heuristic for performing the acyclic orientation. The final stage of the proposed approach consists in scheduling the co-simulation on a multi-core architecture. ...
E o i ð Þ: ð33Þ
Objective function The objective of this linear program is to minimize the makespan of the dependence graph: minðP Þ: ð34Þ
Multi-core scheduling Heuristic A variety of list multi-core ...
doi:10.2516/ogst/2019009
fatcat:7snlursirnd5dnrv5zm7i4wjzu
« Previous
Showing results 1 — 15 out of 50,686 results