鍑犱綍浼樺寲鍦ㄩ�夊潃闂涓殑搴旂敤

榛勬旦鏅� 娓犲噯 浠昏儨闊�

绠�浠�
瀹為獙鑳屾櫙 鍙傝�冩枃鐚�

瀹為獙鍐呭
鐩稿叧宸ヤ綔绠楁硶璇﹁В棰勫鐞�绠楁硶1绠楁硶2

瀹為獙缁撴灉
娴嬭瘯鍜岀粨鏋�鎬荤粨

鐢ㄦ埛鎵嬪唽
鐣岄潰鍜屾搷浣�

瀹為獙鑳屾櫙

缁勫悎浼樺寲闂閫氬父姹傝В鐨勬槸锛屽湪澶氫釜涓嶇瓑寮忔垨绛夊紡绾︽潫涓嬶紝涓�涓嚱鏁扮殑鏈�澶ф渶灏忓�奸棶棰樸�傜劧鑰屾湁涓�绫诲父瑙侀棶棰樺苟涓嶈兘寤烘ā鎴愮粍鍚堜紭鍖栭棶棰樻眰瑙ｏ紝杩欑被闂鐨勭害鏉熼�氬父鐢变竴缁勫嚑浣曚綋缁欏嚭锛屾垜浠О杩欑被闂涓哄嚑浣曚紭鍖栭棶棰橈紙geometric optimization problems锛夈�傚埄鐢ㄥ嚑浣曚綋涔嬮棿鐗规湁鐨勬�ц川锛屽彲浠ュ緱鍒版洿蹇洿绠�鍗曠殑浼樺寲绠楁硶銆傚嚑浣曚紭鍖栭棶棰樼殑姹傝В杩囩▼涓粡甯镐細鐢ㄥ埌涓嬪垪鍑犵鏂规硶閲岀殑涓�涓垨澶氫釜锛氬弬鏁板寲鎼滅储锛坧arametric searching锛夛紝闅忔満鍖栵紙randomization锛夛紝鎵╁厖鍥撅紙expander graphs锛夛紝鍑犱綍鍒囧壊锛坓eometric cuttings锛夛紝鐭╅樀鎼滅储锛坢atrix searching锛夛紝灏忔暟寮忔娊鏍凤紙decimation or prune-and-search锛夛紝鎶借薄绾挎�ц鍒掞紙abstract linear programming锛夌瓑銆傛洿澶氬叧浜庡嚑浣曚紭鍖栫殑缁忓吀姹傝В鏂规硶鍜屽簲鐢ㄨ[1]銆�

閫夊潃闂锛坒acility location problem锛夋槸杩愮瀛︿腑鐨勭粡鍏搁棶棰樹箣涓�锛屽湪鐜板疄涓叿鏈夐潪甯稿箍娉涚殑杩愮敤锛屼緥濡傚浣曢�夊畾閭眬銆佽秴甯傘�佸尰闄㈢瓑鍏叡璁炬柦鐨勫湴鍧�浠ヤ娇寰楄兘澶熷彈鎯犵殑浜虹兢鏈�骞匡紝濡備綍閫夊畾姹℃煋宸ヤ笟鐨勫湴鍧�浣垮緱褰卞搷鏈�灏忕瓑銆傚嚑浣曚紭鍖栦腑鐨勮澶氭柟娉曞彲浠ュ湪閫夊潃闂涓緱鍒板簲鐢紝鍏稿瀷鐨勯棶棰樻ā鍨嬫湁p-center闂銆乸-mdian闂銆佽鐩栭棶棰樸�乸-line-center闂銆乻egment-center闂绛夈�傝繖褰撲腑鐨勯棶棰樺張鍙互閫氳繃闄愬畾瀹归噺銆佸鍔犺垂鐢ㄦ秷鑰楃瓑鏂瑰紡鍙樼琛嶇敓鍑鸿澶氭墿灞曢棶棰樸�傛洿澶氶�夊潃闂鐨勪粙缁嶈[2]銆�

鏈璇曢獙涓昏鍐呭

鎴戜滑閲嶇偣瀹炵幇鐨勬槸2010骞村彂琛ㄥ湪EJOR涓婄殑鍙傝�冩枃鐚甗3]锛孍JOR鏄繍绛瑰棰嗗煙鐨勫浗闄呰憲鍚嶆湡鍒娿�俒3]涓粙缁嶄簡璁稿绠楁硶锛屾垜浠寫閫夊叾涓殑MAXCOV闂杩涜閲嶇偣鐮旂┒銆傝繖涓�闂鍦ㄥ疄闄呴棶棰樹腑鐨勫簲鐢ㄨ儗鏅槸杩欐牱鐨勶細褰撳墠宸茬粡瀛樺湪鐫�璁稿鍟嗕笟璁炬柦浠ュ強椤惧鐨勫垎甯冿紝姣忎釜鍟嗕笟璁炬柦鎴戜滑鐢ㄨ摑鐐硅〃绀猴紝姣忎釜椤惧鎴戜滑鐢ㄧ孩鐐硅〃绀猴紝姣忎綅椤惧閮戒細閫夋嫨鍘昏窛绂讳粬鏈�杩戠殑鍟嗕笟璁炬柦鍏夐【锛岄偅鍋囧鎴戜滑鎯虫柊澧炰竴涓晢涓氳鏂斤紝搴旇鏀剧疆鍦ㄤ粈涔堝湴鏂规墠鑳藉惛寮曞埌鏈�澶氱殑椤惧锛熻繖灏辨槸鎵�璋撶殑MAXCOV闂銆�

浠ヤ笅鏄妯℃澘鎻愪緵鑰呯殑淇℃伅锛�

© 2005 Whatsisname Thingymajig

Validate XHTML 1.0 Strict

Email Webmaster

Photo Credit: Dimiter Tzankov, stock.xchng