This paper introduces a novel multi-objective algorithm (HMPSO) based on discrete particle swarm optimization (PSO) to solve vehicle routing problems with time windows (VRPTW). The presented HMPSO algorithm was combined with an advanced discrete PSO based on set and variable neighbourhood searches to find Pareto optimal routing solutions. These consisted of a complete routing schedule for serving the customers to minimize the two aims of travelling distance and number of vehicles. To increase the discrete PSO efficiency, a novel decoding scheme based on set was designed, and the variable neighbourhood local search was employed to explore new solutions. The experiment results were showed for a set of the Solomon's 56 VRPTW. The HMPSO algorithm was compared with some algorithms published in papers with the computational evaluations clearly supporting the high performance of the proposed HMPSO algorithm against other algorithms, and confirming that the HMPSO is an efficient algorithm because of a reasonable computational time and cost in solve VRPTW.

à Ôàêóëüòåò ïðîåêòèðîâàíèÿ äîðîã è òðàíñïîðòíûõ ñðåäñòâ, Øàíüäóíñêèé óíèâåðñèòåò òåõíîëîãèé, Öçûáî, Êèòàé á Ôàêóëüòåò ýëåêòðîìàøèíîñòðîåíèÿ è ýëåêòðîíèêè, Öçûáîñêèé ïðîôåññèîíàëüíûé èíñòèòóò, Öçûáî, Êèòàé Ïðè ðàáîòå ÿäåðíîãî ðåâåðñ-ïîòî÷íîãî ðåàêòîðà êåðàìè÷åñêèå ñîòîâûå ðåãåíåðàòîðû ïîäâåðãàþòñÿ äåéñòâèþ òåðìîóäàðíîé íàãðóçêè. Ñ ïîìîùüþ ïðîãðàììíîãî îáåñïå÷åíèÿ CFX ïðîâåäåíî ÷èñëåííîå ìîäåëèðîâàíèå ýïþð òåìïåðàòóðû è òåìïåðàòóðíîãî íàïðÿaeåíèÿ êåðà-ìè÷åñêèõ ñîòîâûõ ðåãåíåðàòîðîâ. Èññëåäîâàíî èçìåíåíèå òåìïåðàòóð âî âðåìåíè äëÿ êåðà-ìè÷åñêèõ ñîòîâûõ ðåãåíåðàòîðîâ ñ îòâåðñòèÿìè ðàçëè÷íîé ôîðìû. Ïðîàíàëèçèðîâàíû ýïþðû òåìïåðàòóðíîãî íàïðÿaeåíèÿ ðåãåíåðàòîðîâ ñ ðàçíûìè êîíñòðóêöèîííûìè è ýêñïëóàòàöèîííûìè ïàðàìåòðàìè. Óñòàíîâëåíî, ÷òî òåìïåðàòóðíîå íàïðÿaeåíèå êåðàìè÷åñêîãî ñîòîâîãî ðåãåíåðàòîðà çàâèñèò îò ôîðìû îòâåðñòèé, ïîðèñòîñòè è òîëùèíû ñòåíîê. Ðåçóëüòàòû äàííîãî èññëåäîâàíèÿ ñëóaeàò òåîðåòè÷åñêîé áàçîé äëÿ îïòèìèçàöèè êåðàìè-÷åñêèõ ñîòîâûõ ðåãåíåðàòîðîâ.