Showing 1 - 8 of 8
Solving a multiple travelling salesperson (mTSP) is more difficult than solving a travelling salesperson. Although the TSP has received a great deal of attention, the research on the mTSP is limited. In the mTSP, the N cities must be partitioned into m tours, with each tour resulting in a TSP...
Persistent link: https://www.econbiz.de/10010668822
The integrated problem of allocating and routing blood for a public and private health care system is addressed. We modelled the problem as multiple-vehicle, multi-depot, multi-criteria allocation-routing problem which is termed as integrated allocation-routing (IAR) problem. We propose a...
Persistent link: https://www.econbiz.de/10010691672
The job shop problem is among the class of non-deterministic polynomial time hard combinatorial problems. This research article addresses the problem of static job shop scheduling on the job-based representation and the rule-based representations. The popular search techniques, such as the...
Persistent link: https://www.econbiz.de/10010816512
Transportation industry is a fairly large industry in today's globalised world, and has significant effect too. Each and every big or small industry is bound to use the transportation facilities or logistics. The main problems in this logistics operation are optimising the cost, time, distance...
Persistent link: https://www.econbiz.de/10010668815
Public healthcare institutions in India continue to be the major source of healthcare in both rural and urban areas. This study has considered resource utilisation in the context of drug supplies to the public healthcare. Drug inventory management assessment tool (DIMAT) is developed to quantify...
Persistent link: https://www.econbiz.de/10010816511
Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...
Persistent link: https://www.econbiz.de/10005048890
Generalised assignment problem (GAP) is a well-known non-deterministic polynomial (NP) hard combinatorial optimisation problem to find the minimum cost during assignment of jobs to agents so that each job is assigned exactly once and agents are not overloaded. In this research, we look at the...
Persistent link: https://www.econbiz.de/10008564281
Logistics is no longer seen as tactical and cost-driven – it is strategic. Considering the driver-on-time rules and with the perishable nature of the products, the travel length/time is one of the critical constraints in distribution logistics. We consider a typical logistics problem with...
Persistent link: https://www.econbiz.de/10010691670