Семинар за рачунарство и примењену математику, 20. фебруар 2018.

Наредни састанак Семинара биће одржан у уторак, 20. фебруара 2018. у сали 301ф Математичког института САНУ са почетком у 14:15 часова.

Предавач: Оливера Станчић, Економски факултет Универзитета у Крагујевцу

Наслов предавања: NOVEL FORMULATIONS AND VNS-BASED HEURISTICS FOR SINGLE AND MULTIPLE ALLOCATION p-HUB MAXIMAL COVERING PROBLEMS

Апстракт: In this talk, the results of the research on uncapacitated single and multiple allocation p-hub maximal covering problems (USApHMCP and UMApHMCP) with binary and partial covering criteria will be presented. New mixed-integer programming formulations of the considered problems are introduced, showing that they are valid for both binary and partial coverage cases. The efficiency of the proposed formulations is evaluated through computational experiments on smaller-size hub test instances, and compared with the state-of-the art models from the literature. In order to solve instances of larger problem dimension, two heuristic methods based on Variable Neighborhood Search (VNS) are developed: General VNS (GVNS) for USApHMCP and Basic VNS (BVNS) for UMApHMCP. Computational experiments conducted on smaller-size instances showed that both GVNS and BVNS almost instantly reach all known optimal solutions. The proposed GVNS and BVNS showed to be very efficient when solving large and large-scale hub instances with up to 1000 nodes, which were not previously considered as test instances for the considered problems. Both GVNS and BVNS provided best solutions on challenging USApHMCP and UMApHMCP instances for both coverage cases in short running times, which indicates their potential as solution methods for similar hub location problems.

This is joint work with S. Mišković, Z. Stanimirović, and R. Todosijević.

 


Нажалост није могуће оставити коментар.

Вести и дешавања


Активности на семинарима

све вести