[PDF][PDF] Models and heuristic algorithms for solving discrete location problems of temporary disposal places in Palembang City
The discrete location problem has given more attention to operations research as the
prevalent locationallocation problem in recent years. Discrete location problems have three …
prevalent locationallocation problem in recent years. Discrete location problems have three …
A novel districting design approach for on-time last-mile delivery: An application on an express postal company
Last-mile logistics corresponds to the last leg of the supply chain, ie, the delivery of goods to
final customers, and they comprise the core activities of postal and courier companies …
final customers, and they comprise the core activities of postal and courier companies …
An optimization-based approach for the healthcare districting under uncertainty
In this paper, we address a districting problem motivated by a real-world case study to
partition residential areas of a region for a healthcare system operation under interval …
partition residential areas of a region for a healthcare system operation under interval …
A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and p-median-based dispersion minimization
RZ Ríos-Mercado, AM Álvarez-Socarrás… - Computers & Operations …, 2021 - Elsevier
A districting problem consisting of the minimization of a dispersion function subject to
multiple-activity balancing and contiguity constraints is addressed. This problem arises from …
multiple-activity balancing and contiguity constraints is addressed. This problem arises from …
A heuristic algorithm for solving a large-scale real-world territory design problem
In this work, we present and evaluate heuristic techniques for a real-world territory design
problem of a major dairy company which produces and distributes perishable products. The …
problem of a major dairy company which produces and distributes perishable products. The …
[HTML][HTML] An efficient probability-based VNS algorithm for delivery territory design
A Aly, AF Gabor, N Mladenovic… - Computers & Operations …, 2024 - Elsevier
This paper deals with the Delivery Territory Design Problem (DTDP), a districting problem
that often occurs in delivery operations. The goal of the problem is to construct clusters of …
that often occurs in delivery operations. The goal of the problem is to construct clusters of …
Solutions for districting problems with chance-constrained balancing requirements
In this paper, a districting problem with stochastic demands is investigated. The goal is to
divide a geographic area into p contiguous districts such that, with some given probability …
divide a geographic area into p contiguous districts such that, with some given probability …
A districting application with a quality of service objective
E Álvarez-Miranda, J Pereira - Mathematics, 2021 - mdpi.com
E-commerce sales have led to a considerable increase in the demand for last-mile delivery
companies, revealing several problems in their logistics processes. Among these problems …
companies, revealing several problems in their logistics processes. Among these problems …
P-中心选址问题的一种降阶回溯算法.
尚春剑, 宁爱兵, 彭大江… - Application Research of …, 2021 - search.ebscohost.com
运筹学研究领域中的应急服务设施选址问题有许多求解模型, 选取了P 中心模型进行研究,
首先研究了该问题的数学性质, 并给出了证明, 利用这些数学性质能对问题进行降阶从而缩小 …
首先研究了该问题的数学性质, 并给出了证明, 利用这些数学性质能对问题进行降阶从而缩小 …
An Effective VNS for Delivery Districting
A Aly, AF Gabor, N Mladenovic - International Conference on Variable …, 2022 - Springer
This paper deals with the Delivery Territory Design Problem (DTDP), in which n points have
to be allocated to p territories, such that balancing and path connectivity requirements are …
to be allocated to p territories, such that balancing and path connectivity requirements are …