using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...

the biggest challenges faced in big cities are greenhouse gas emission and growing energy needs. efficient utilization of existing infrastructures has a prominent role in response to the challenges. energy hub approach embraces performance of different energy networks. energy hub is defined as a super node in electrical system receiving distinctive energy carriers such as gas and electricity in...

Based on the real-world inventory control problem of a capacitated healthcare apparel service centre in Hong Kong which provides tailor-made apparel-making services for the elderly and disabled people, this paper studies a partial backordered continuous review inventory control problem in which the product demand follows a Poisson process with a constant lead time. The system is controlled by a...

We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect them to the central hub with direct links and then we connect each nonhub node to a hub. This results in a star/star network. In the first problem, called the Star p-hub Cent...

1 Centre for Marine Studies, and ARC Centre of Excellence for Coral Reef Studies, The University of Queensland, St Lucia, Qld 4072, Australia; 2 Centre Scientifique de Monaco, Avenue St Martin, MC 98000, Monaco; 3 Applied Environmental Decision Analysis CERF Hub, School of Botany, University of Melbourne, Parkville, VIC 3010, Australia; and 4 Ohio State University, School of Earth Sciences, 125...

The p-hub center problem is to locate p hubs and to allocate non-hub nodes to hub nodes such that the maximum travel time (or distance) between any origin–destination pair is minimized. We address the p-hub center allocation problem, a subproblem of the location problem, where hub locations are given. We present complexity results and IP formulations for several versions of the problem. We esta...